相关论文: Efficient Scheme for Initializing a Quantum Regist…

Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…

We develop a recursive algorithm to generalize the quantum SWAP test for an arbitrary number $m$ of quantum states requiring $O(m)$ controlled-swap (CSWAP) gates and $O(\log m)$ ancillary qubits. We construct a quantum circuit able to…

We report on the implementation of arbitrary circuits on a universal two-qubit register that can act as the computational module in a trapped-ion quantum computer based on the quantum charge-coupled device architecture. A universal set of…

We consider a quantum circuit in which shift and rotation operations on qubits are performed by swap gates and controlled swap gates. These operations can be useful for quantum computers performing elementary arithmetic operations such as…

As one of the most intriguing intrinsic properties of quantum world, quantum superposition provokes great interests in its own generation. Oszmaniec [Phys. Rev. Lett. 116, 110403 (2016)] have proven that though a universal quantum machine…

Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The problem arises as the…

An implementation of a universal solid-state quantum register based on electron space states in field-defined double quantum dots (DQD possesses one electron in two adjacent tunnel bound dots) in an ultrathin semiconductor nanowire is…

The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…

While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…

In a previous paper [quant-ph/0408045] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative algorithm which uses a small number of quantum oracles…

We describe and analyze a hybrid approach to scalable quantum computation based on an optically connected network of few-qubit quantum registers. We show that probabilistically connected five-qubit quantum registers suffice for…

This paper presents an enhancement to Grover's search algorithm for instances where the number of items (or the size of the search problem) $N$ is not a power of 2. By employing an efficient algorithm for the preparation of uniform quantum…

We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state…

Using the properties of quantum superposition, we propose a quantum classification algorithm to efficiently perform multi-class classification tasks, where the training data are loaded into parameterized operators which are applied to the…

We consider decoherence of quantum registers, which consist of the qubits sited approximately periodically in space. The sites of the qubits are permitted to have a small random variance. We derive the explicit conditions under which the…

A qubit, or quantum bit, is conventionally defined as "a physical system for storing information that is capable of existing in either of two quantum states or in a superposition of both". In this paper, we examine the simple question of…

We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array…

We propose an efficient scheme for constructing arbitrary 2-D cluster states using probabilistic entangling quantum gates.In our scheme, the 2-D cluster state is constructed with star-like basic units generated from 1-D cluster chains.By…

We develop a representation of an n-qubit register that parameterizes its statevector as a series of nested entanglements. We show that the recursive substructure of this representation provides a natural framework for automating the…

We present a scheme for a self-testing quantum random number generator. Compared to the fully device-independent model, our scheme requires an extra natural assumption, namely that the mean energy per signal is bounded. The scheme is…