Related papers: Efficient Implementation of a Quantum Algorithm wi…
The paradigm behind digital quantum computing inherits the idea of using binary information processing. Nature in fact gives much more rich structures of physical objects that can be used for encoding information, which is especially…
Grover's quantum algorithm can find a marked item from an unstructured database faster than any classical algorithm, and hence it has been used for several applications such as cryptanalysis and optimization. When there exist multiple…
Quantum computation architecture based on $d$-level systems, or qudits, has attracted considerable attention recently due to their enlarged Hilbert space. Extensive theoretical and experimental studies have addressed aspects of algorithms…
The fidelity of laser-driven quantum logic operations on trapped ion qubits tend to be lower than microwave-driven logic operations due to the difficulty of stabilizing the driving fields at the ion location. Through stabilization of the…
Grover's algorithm is a primary algorithm offered as evidence that quantum computers can provide an advantage over classical computers. It involves an "oracle" specified for a given application whose structure is not part of the formal…
Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of…
Trapped ion (TI) qubits are a leading quantum computing platform. Current TI systems have less than 60 qubits, but a modular architecture known as the Quantum Charge-Coupled Device (QCCD) is a promising path to scale up devices. There is a…
We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as…
We describe and benchmark a new quantum charge-coupled device (QCCD) trapped-ion quantum computer based on a linear trap with periodic boundary conditions, which resembles a race track. The new system successfully incorporates several…
The trapped-ion system has been a leading platform for practical quantum computation and quantum simulation since the first scheme of a quantum gate was proposed by Cirac and Zoller in 1995. Quantum gates with trapped ions have shown the…
Particle physics underpins our understanding of the world at a fundamental level by describing the interplay of matter and forces through gauge theories. Yet, despite their unmatched success, the intrinsic quantum mechanical nature of gauge…
Grover's algorithm achieves a quadratic speedup over classical algorithms, but it is considered necessary to know the value of $\lambda$ exactly [Phys. Rev. Lett. 95, 150501 (2005); Phys. Rev. Lett. 113, 210501 (2014)], where $\lambda$ is…
We report the realization of an elementary quantum processor based on a linear crystal of trapped ions. Each ion serves as a quantum bit (qubit) to store the quantum information in long lived electronic states. We present the realization of…
Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm,…
Given a parameterized quantum circuit such that a certain setting of these real-valued parameters corresponds to Grover's celebrated search algorithm, can a variational algorithm recover these settings and hence learn Grover's algorithm? We…
Moving trapped-ion qubits in a microstructured array of radiofrequency traps offers a route towards realizing scalable quantum processing nodes. Establishing such nodes, providing sufficient functionality to represent a building block for…
Grover's quantum search algorithm, involving a large number of qubits, is highly sensitive to errors in the physical implementation of the unitary operators. This poses an intrinsic limitation to the size of the database that can be…
The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large…
Using resonant interaction of three Rydberg atoms with a single-mode microwave cavity, we consider a realization of three-qubit Grover search algorithm in the presence of weak cavity decay, based on a previous idea for three-qubit quantum…
We first consider the basic requirements for a quantum computer, arguing for the attractiveness of nuclear spins as information-bearing entities, and light for the coupling which allows quantum gates. We then survey the strengths of and…