首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We explicitly show how universal three-qubit gates can be performed. As an example of a quantum algorithm, we outline the implementation of the three-qubit Deutsch-Jozsa algorithm in this system.   相似文献   

2.
We prove the existence of the exact CNOT gate on aquantum computer with the nearest-neighbor exchange interaction in the serial operation mode. Its existence has been an open problem, though a concrete sequence of exchange operations, which is approximately locally equivalent to the exact CNOT, has already been found. We found the exact values of time parameters (exchange rates between qubits) by using computer algebraic techniques such as Gröbner bases and resultants. These techniques have been widely used for finding rigorous solutions of simultaneous algebraic equations, and here are applied to finding quantum gates on the decoherence-free subsystem for the first time.PACS: 02.70.Wz, 03.65.Yz, 03.67.Lx  相似文献   

3.
Scalability from single-qubit operations to multi-qubit circuits for quantum information processing requires architecture-specific implementations. Semiconductor hybrid qubit architecture is a suitable candidate to realize large-scale quantum information processing, as it combines a universal set of logic gates with fast and all-electrical manipulation of qubits. We propose an implementation of hybrid qubits, based on Si metal-oxide-semiconductor (MOS) quantum dots, compatible with the CMOS industrial technological standards. We discuss the realization of multi-qubit circuits capable of fault-tolerant computation and quantum error correction, by evaluating the time and space resources needed for their implementation. As a result, the maximum density of quantum information is extracted from a circuit including eight logical qubits encoded by the [[7, 1, 3]] Steane code. The corresponding surface density of logical qubits is 2.6 Mqubit/cm\(^2\).  相似文献   

4.
We propose two fault-tolerant high-capacity quantum key distribution schemes, in which an entangled pair over a collective-noise channel consisting of one logical qubit and one physical qubit can carry four bits of key information. The basic idea is to use 2-extended unitary operations from collective noises together with quantum dense coding. The key messages are encoded on logical qubits of two physical qubits with sixteen 2-extended unitary operations based on collective noises. The key can be recovered using Bell-state analysis on the logical qubit and a single-photon measurement on the physical qubit rather than three-qubit GHZ joint measurements. The proposed protocols require a collation table to be shared between Alice and Bob in advance. Consequently, the key messages carried by an entangled state, in our protocol, have doubled at the price of sharing the collation table between Alice and Bob. However, the efficiency of qubits is enhanced because a quantum bit is more expensive to prepare than a classical bit.  相似文献   

5.
We introduce simple qubit-encodings and logic gates which eliminate the need for certain difficult single-qubit operations in superconducting phase-qubits, while preserving universality. The simplest encoding uses two physical qubits per logical qubit. Two architectures for its implementation are proposed: one employing N physical qubits out of which N/2 are ancillas fixed in the |1 state, the other employing N/2+1 physical qubits, one of which is a bus qubit connected to all others. Details of a minimal set of universal encoded logic operations are given, together with recoupling schemes, that require nanosecond pulses. A generalization to codes with higher ratio of number of logical qubits per physical qubits is presented. Compatible decoherence and noise suppression strategies are also discussed. PACS: 03.67.Lx; 85.25.Hv; 03.67.-a; 89.70.+c  相似文献   

6.
We present Monte Carlo wavefunction simulations for quantum computations employing an exchange-coupled array of quantum dots. Employing a combination of experimentally and theoretically available parameters, we find that gate fidelities greater than 98% may be obtained with current experimental and technological capabilities. Application to an encoded 3 qubit (nine physical qubits) Deutsch-Josza computation indicates that the algorithmic fidelity is more a question of the total time to implement the gates than of the physical complexity of those gates. PACS: 81.07.Ta, 02.70.Ss, 03.67.Lx, 03.65.Yz  相似文献   

7.
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a lattice suffice to perform all quantum logic operations. Anyonic quantum computation might be realized using quasiparticles of the fractional quantum Hall effect. PACS: 03.65-Lx  相似文献   

8.
Quantum correlations, including entanglement and discord with its geometric measure in a three-qubit Heisenberg XY chain, with phase decoherence, are investigated when a nonuniform magnetic field is applied. When the qubits are initially in an unentangled state, the nearest neighbor pairwise correlations are destroyed by phase decoherence, but stationary correlations appear for next-to-neighbor qubits. With an inhomogeneous magnetic field, the stationary correlations appear for nearest neighbor qubits and they disappear for next-to-nearest neighbor qubits. But when the qubits are initially in an entangled state, an inhomogeneous magnetic field can enhance the stationary correlations of next-to-neighbor qubits, but it cannot do so for nearest neighbor qubits. The decoherence effect on stationary correlations is much stronger for next-to-nearest neighbor qubits than it is for nearest neighbor qubits. Finally, a uniform magnetic field can affect the correlations when the qubits are initially in an entangled state, but it cannot affect them when the qubits are initially in an unentangled state.  相似文献   

9.
Simulating quantum computation on a classical computer is a difficult problem. The matrices representing quantum gates, and the vectors modeling qubit states grow exponentially with an increase in the number of qubits. However, by using a novel data structure called the Quantum Information Decision Diagram (QuIDD) that exploits the structure of quantum operators, a useful subset of operator matrices and state vectors can be represented in a form that grows polynomially with the number of qubits. This subset contains, but is not limited to, any equal superposition of n qubits, any computational basis state, n-qubit Pauli matrices, and n-qubit Hadamard matrices. It does not, however, contain the discrete Fourier transform (employed in Shor's algorithm) and some oracles used in Grover's algorithm. We first introduce and motivate decision diagrams and QuIDDs. We then analyze the runtime and memory complexity of QuIDD operations. Finally, we empirically validate QuIDD-based simulation by means of a general-purpose quantum computing simulator QuIDDPro implemented in C++. We simulate various instances of Grover's algorithm with QuIDDPro, and the results demonstrate that QuIDDs asymptotically outperform all other known simulation techniques. Our simulations also show that well-known worst-case instances of classical searching can be circumvented in many specific cases by data compression techniques. PACS: 03.67.Lx, 03.65.Fd, 03.65.Vd, 07.05.Bx  相似文献   

10.
We propose a new scheme to implement gate operations in a one dimensional linear nearest neighbor array, by using dynamic learning algorithm. This is accomplished by training quantum system using a back propagation technique, to find the system parameters that implement gate operations directly. The key feature of our scheme is that, we can reduce the computational overhead of a quantum circuit by finding the parameters to implement the desired gate operation directly, without decomposing them into a sequence of elementary gate operations. We show how the training algorithm can be used as a tool for finding the parameters for implementing controlled-NOT (CNOT) and Toffoli gates between next-to-nearest neighbor qubits in an Ising-coupled linear nearest neighbor system. We then show how the scheme can be used to find parameters for realizing swap gates first, between two adjacent qubits and then, between two next-to-nearest-neighbor qubits, in each case without decomposing it into 3 CNOT gates. Finally, we show how the scheme can be extended to systems with non-diagonal interactions. To demonstrate, we train a quantum system with Heisenberg interactions to find the parameters to realize a swap operation.  相似文献   

11.
We discuss the implementation of quantum gate operations in a self-assembled dipolar crystal of polar molecules. Here qubits are encoded in long-lived spin states of the molecular ground state and stabilized against collisions by repulsive dipole–dipole interactions. To overcome the single site addressability problem in this high density crystalline phase, we describe a new approach for implementing controlled single and two-qubit operations based on resonantly enhanced spin–spin interactions mediated by a localized phonon mode. This local mode is created at a specified lattice position with the help of an additional marker molecule such that individual qubits can be manipulated by using otherwise global static and microwave fields only. We present a general strategy for generating state and time dependent dipole moments to implement a universal set of gate operations for molecular qubits and we analyze the resulting gate fidelities under realistic conditions. Our analysis demonstrates the experimental feasibility of this approach for scalable quantum computing or digital quantum simulation schemes with polar molecules.  相似文献   

12.
We propose a model for a scalable quantum computing in the circuit quantum electrodynamics architecture. In the Kagome lattice of qubits, three qubits are connected to each other through a superconducting three-junction flux qubit at the vertices of the lattice. By controlling one of the three-Josephson-junction energies of the intervening flux qubit, we can achieve the circulator function that couples arbitrary pair of two qubits among three. This selective coupling enables the interaction between two nearest neighbor qubits in the Kagome lattice, and further the two-qubit gate operation between any pair of qubits in the whole lattice by performing consecutive nearest neighbor two-qubit gates.  相似文献   

13.
We propose a new scheme for implementing gate operations between remote qubits in linear nearest neighbor (LNN) architectures, one that does not require qubits to be adjacent to each other in order to perform a gate operation between them. The key feature of our scheme is a new two-control, one-target controlled-unitary gate operation, which we refer to as the C2(?I) gate. The gate operation can be implemented easily in a single step, requiring only a single control parameter of the system Hamiltonian. Using the C2(?I) gate, we show how to implement CNOT gate operations between remote qubits that do not have any direct coupling between them, along an LNN array. Since this is achieved without requiring swap operations or additional ancilla qubits in the circuit, the quantum cost of our circuit can be more than 50 % lower than those using conventional swap methods. All CNOT gate operations between remote qubits can be achieved with fidelity greater than 99.5 %.  相似文献   

14.
We show how to convert an arbitrary stabilizer code into a bipartite quantum code. A bipartite quantum code is one that involves two senders and one receiver. The two senders exploit both nonlocal and local quantum resources to encode quantum information with local encoding circuits. They transmit their encoded quantum data to a single receiver who then decodes the transmitted quantum information. The nonlocal resources in a bipartite code are ebits and nonlocal information qubits, and the local resources are ancillas and local information qubits. The technique of bipartite quantum error correction is useful in both the quantum communication scenario described above and in fault-tolerant quantum computation. It has application in fault-tolerant quantum computation because we can prepare nonlocal resources offline and exploit local encoding circuits. In particular, we derive an encoding circuit for a bipartite version of the Steane code that is local and additionally requires only nearest-neighbor interactions. We have simulated this encoding in the CNOT extended rectangle with a publicly available fault-tolerant simulation software. The result is that there is an improvement in the “pseudothreshold” with respect to the baseline Steane code, under the assumption that quantum memory errors occur less frequently than quantum gate errors.  相似文献   

15.
Controlling Spin Qubits in Quantum Dots   总被引:1,自引:0,他引:1  
We review progress on the spintronics proposal for quantum computing where the quantum bits (qubits) are implemented with electron spins. We calculate the exchange interaction of coupled quantum dots and present experiments, where the exchange coupling is measured via transport. Then, experiments on single spins on dots are described, where long spin relaxation times, on the order of a millisecond, are observed. We consider spin-orbit interaction as sources of spin decoherence and find theoretically that also long decoherence times are expected. Further, we describe the concept of spin filtering using quantum dots and show data of successful experiments. We also show an implementation of a read out scheme for spin qubits and define how qubits can be measured with high precision. Then, we propose new experiments, where the spin decoherence time and the Rabi oscillations of single electrons can be measured via charge transport through quantum dots. Finally, all these achievements have promising applications both in conventional and quantum information processing. PACS: 03.67.Lx, 03.67.Mn, 73.23.Hk, 85.35.Be  相似文献   

16.
While a couple of impressive quantum technologies have been proposed, they have several intrinsic limitations which must be considered by circuit designers to produce realizable circuits. Limited interaction distance between gate qubits is one of the most common limitations. In this paper, we suggest extensions of the existing synthesis flow aimed to realize circuits for quantum architectures with linear nearest neighbor interaction. To this end, a template matching optimization, an exact synthesis approach, and two reordering strategies are introduced. The proposed methods are combined as an integrated synthesis flow. Experiments show that by using the suggested flow, quantum cost can be improved by more than 50% on average.  相似文献   

17.
Non-adiabatic holonomic quantum gate in decoherence-free subspaces is of greatly practical importance due to its built-in fault tolerance, coherence stabilization virtues, and short run-time. Here, we propose some compact schemes to implement two- and three-qubit controlled unitary quantum gates and Fredkin gate. For the controlled unitary quantum gates, the unitary operator acting on the target qubit is an arbitrary single-qubit gate operation. The controlled quantum gates can be directly implemented by utilizing non-adiabatic holonomy in decoherence-free subspaces and the required resource for the decoherence-free subspace encoding is minimal by using only two neighboring physical qubits undergoing collective dephasing to encode a logical qubit.  相似文献   

18.
We show that the entanglement dynamics for the pure state of a closed two-qubit system is part of a 10-dimensional complex linear differential equation defined on a supersphere, and the coefficients therein are completely determined by the system Hamiltonian. We apply the result to two physical examples of Josephson junction qubits and exchange Hamiltonians, deriving analytic solutions for the time evolution of entanglement. The Hamiltonian coefficients determine whether the entanglement is periodic. These results allow of investigating how to generate and manipulate entanglements efficiently, which are required by both quantum computation and quantum communication.  相似文献   

19.
Explicit controlled-NOT gate sequences between two qubits of different types are presented in view of applications for large-scale quantum computation. Here, the building blocks for such composite systems are qubits based on the electrostatically confined electronic spin in semiconductor quantum dots. For each system the effective Hamiltonian models expressed by only exchange interactions between pair of electrons are exploited in two different geometrical configurations. A numerical genetic algorithm that takes into account the realistic physical parameters involved is adopted. Gate operations are addressed by modulating the tunneling barriers and the energy offsets between different couple of quantum dots. Gate infidelities are calculated considering limitations due to unideal control of gate sequence pulses, hyperfine interaction and charge noise.  相似文献   

20.
利用基于量子位测量的二进制量子遗传算法(QGA)对连续问题进行优化时,频繁的解码运算严重降低了优化效率。针对该问题,提出一种基于量子位相位编码的QGA。该算法直接采用量子位的相位对染色体进行编码,利用量子旋转门实现染色体上相位的更新,通过Pauli-Z门实现染色体的变异,由于优化过程统一在 空间进行,因此对不同尺度空间的优化问题具有良好的适应性。以单级倒立摆T-S模糊控制器参数的优化设计为例进行仿真,证明该算法在搜索能力和优化效率方面的优势。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号