Long-range coupling and scalable architecture for superconducting flux qubits

Physics – Condensed Matter – Superconductivity

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

8 pages, 11 figures

Scientific paper

10.1103/PhysRevB.76.174507

Constructing a fault-tolerant quantum computer is a daunting task. Given any design, it is possible to determine the maximum error rate of each type of component that can be tolerated while still permitting arbitrarily large-scale quantum computation. It is an underappreciated fact that including an appropriately designed mechanism enabling long-range qubit coupling or transport substantially increases the maximum tolerable error rates of all components. With this thought in mind, we take the superconducting flux qubit coupling mechanism described in PRB 70, 140501 (2004) and extend it to allow approximately 500 MHz coupling of square flux qubits, 50 um a side, at a distance of up to several mm. This mechanism is then used as the basis of two scalable architectures for flux qubits taking into account crosstalk and fault-tolerant considerations such as permitting a universal set of logical gates, parallelism, measurement and initialization, and data mobility.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Long-range coupling and scalable architecture for superconducting flux qubits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Long-range coupling and scalable architecture for superconducting flux qubits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Long-range coupling and scalable architecture for superconducting flux qubits will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-206392

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.