Abstract

We consider a one-dimensional chain of many superconducting quantum interference devices (SQUIDs), serving as charge qubits. Each SQUID is coupled to its nearest neighbors through constant capacitances. We study the quantum logic operations and implementation of entanglement in this system. Arrays with two and three qubits are considered in detail. We show that the creation of entanglement with an arbitrary number of qubits can be implemented, without systematic errors, even when the coupling between qubits is not small. A relatively large coupling constant allows one to increase the clock speed of the quantum computer. We analytically and numerically demonstrate the creation of the entanglement for this case, which can be a good test for the experimental implementation of a relatively simple quantum protocol with many qubits. We discuss a possible application of our approach for implementing universal quantum logic for more complex algorithms by decreasing the coupling constant and, correspondingly, decreasing the clock speed. The errors introduced by the long-range interaction for the universal logic gates are estimated analytically and calculated numerically. Our results can be useful for experimental implementation of quantum algorithms using controlled magnetic fluxes and gate voltages applied to the SQUIDs. The algorithms discussed in this paper can be implemented using already existing technologies in superconducting systems with constant inter-qubit coupling.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.