相关论文: Schemes for Parallel Quantum Computation Without L…
The power of a quantum circuit is determined through the number of two-qubit entangling gates that can be performed within the coherence time of the system. In the absence of parallel quantum gate operations, this would make the quantum…
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…
Quantum algorithms can be realized in the form of a quantum circuit. To map quantum circuit for specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighbourhood…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique further develops tools from many-body physics - based on finitely correlated or projected entangled pair states -…
We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…
Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits…
Quantum state tomography, the ability to deduce the state of a quantum system from measured data, is the gold standard for verification and benchmarking of quantum devices. It has been realized in systems with few components, but for larger…
We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the…
Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
The model of open quantum systems is adopted to describe the non-local dynamical behaviour of qubits processed by entangling gates. The analysis gets to the conclusion that a distinction between evaluation steps and task-oriented computing…
Quantum computing can be realized with numerous different hardware platforms and computational protocols. A highly promising approach to foster scalability is to apply a photonic platform combined with a measurement-induced quantum…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
Universal quantum computation using optical coherent states is studied. A teleportation scheme for a coherent-state qubit is developed and applied to gate operations. This scheme is shown to be robust to detection inefficiency.
The information obtained from the operation of a quantum gate on only two complementary sets of input states is sufficient to estimate the quantum process fidelity of the gate. In the case of entangling gates, these conditions can be used…
Non-local higher-energy auxiliary states have been successfully used to entangle pairs of qubits in different quantum computing systems. Typically a longer-span non-local state or sequential application of few-qubit entangling gates are…
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding…
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…