相关论文: Schemes for Parallel Quantum Computation Without L…
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of…
In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant operations is obtained by error-correcting noisy transformations…
We propose a scalable neutral atom quantum computer with an on-demand interaction through a selective two-qubit gate operation. Atoms are trapped by a lattice of near field Fresnel diffraction lights so that each trap captures a single…
We describe in detail the application of four qubit cluster states, built on the simultaneous entanglement of two photons in the degrees of freedom of polarization and linear momentum, for the realization of a complete set of basic one-way…
We present an efficient quantum algorithm for preparing a pure state on a quantum computer, where the quantum state corresponds to that of a molecular system with a given number $m$ of electrons occupying a given number $n$ of spin…
A scenario for realization of a quantum computer is proposed consisting of spatially distributed q-bits fabricated in a host structure where nuclear spin-spin coupling is mediated by laser pulse controlled electron-nuclear transferred…
We propose two different implementations of an asymmetric two-output probabilistic quantum processor, which can implement a restricted set of one-qubit operations. One of them is constructed by combining asymmetric telecloning with a…
The development of quantum computing systems has been a staple of academic research since the mid-1990s when the first proposal for physical platforms were proposed using Nuclear Magnetic Resonance and Ion-Trap hardware. These first…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
In order to demonstrate non-trivial quantum computations experimentally, such as the synthesis of arbitrary entangled states, it will be useful to understand how to decompose a desired quantum computation into the shortest possible sequence…
We describe an architecture based on a processing 'core' where multiple qubits interact perpetually, and a separate 'store' where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the…
A quantum computer based on an asymmetric coupled dot system has been proposed and shown to operate as the controlled-NOT-gate. The basic idea is (1) the electron is localized in one of the asymmetric coupled dots. (2)The electron transfer…
Quantum error correcting codes have been developed to protect a quantum computer from decoherence due to a noisy environment. In this paper, we present two methods for optimizing the physical implementation of such error correction schemes.…
We propose an effective realization of the universal set of elementary quantum gates in solid state quantum computer based on macroscopic (or mesoscopic) resonance systems - multi-atomic coherent ensembles, squids or quantum dots in quantum…
While the question ``how many CNOT gates are needed to simulate an arbitrary two-qubit operator'' has been conclusively answered -- three are necessary and sufficient -- previous work on this topic assumes that one wants to simulate a given…
The quantum circuit model allows gates between any pair of qubits yet physical instantiations allow only limited interactions. We address this problem by providing an interaction graph together with an efficient method for compiling quantum…
Accurate and efficient implementation of parallel quantum gates is crucial for scalable quantum information processing. However, the unavoidable crosstalk between qubits in current noisy processors impedes the achievement of high gate…
Quantum algorithm design usually assumes access to a perfect quantum computer with ideal properties like full connectivity, noise-freedom and arbitrarily long coherence time. In Noisy Intermediate-Scale Quantum (NISQ) devices, however, the…
The advancement of scalable quantum information processing relies on the accurate and parallel manipulation of a vast number of qubits, potentially reaching into the millions. Superconducting qubits, traditionally controlled through…