Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0702620 · Physical Review B

Long-range coupling and scalable architecture for superconducting flux qubits

Austin G. Fowler, William F. Thompson, Zhizhong Yan, Ashley M. Stephens, B. L. T. Plourde, Frank K. Wilhelm

Published Nov 12, 2007• 45 citations
arXivHTMLPDF

Abstract

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 by Plourde et al. [Phys. Rev. B 70, 140501(R) (2004)] and extend it to allow approximately $500\phantom{\rule{0.3em}{0ex}}\mathrm{MHz}$ coupling of square flux qubits, $50\phantom{\rule{0.3em}{0ex}}\ensuremath{\mu}\mathrm{m}$ a side, at a distance of up to several millimeters. This mechanism is then used as the basis of two scalable architectures for flux qubits taking into account cross-talk and fault-tolerant considerations such as permitting a universal set of logical gates, parallelism, measurement and initialization, and data mobility.

DOI
10.1103/physrevb.76.174507

Related papers

Long-range coupling and scalable architecture for superconducting flux qubits

Austin G. Fowler, W F Thompson, Z Yan +3 more

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 under-appreciated 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 Plourde et al. (Phys. Rev. B, 70, 140501(R) (2004)) and extend it to allow approximately 500~MHz coupling of square flux qubits, 50 µm 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.PACS No.: 03.67.Lx

Canadian Journal of Physics•Apr 1, 2008•1 citation

Fault-tolerant quantum computation with static atomic buses

Matteo Bergonzoni, Laura Pecorari, Sam Norrell +3 more

Efficient quantum error correction and fault-tolerant quantum computing require scalable, high-fidelity long-range connectivity. In neutral-atom quantum computers, this is commonly achieved through atom transport, but shuttling introduces latency and motional heating that worsen with system size. Here, we introduce a neutral-atom architecture based on static atomic buses, in which auxiliary mediator atoms enable long-range entangling operations without qubit transport. The architecture naturally supports long-range stabilizer measurements in high-rate LDPC codes and transversal logical gates between neighboring surface-code patches, enabling a modular framework for efficient logical memories, Clifford computation, and magic-state distillation. To realize these capabilities, we co-design optimal-control protocols for bus-mediated controlled-Z gates that incorporate both microscopic neutral-atom dynamics and architectural constraints. We obtain smooth bus-mediated gates with fidelities approaching 99.9% and durations of a few hundred nanoseconds by combining time-optimal control with interaction-flatness and robustness constraints. Large-scale simulations of quantum error correction and logical entangling operations between neighboring surface-code patches predict more than an order-of-magnitude improvement in logical error rates compared with atom-shuttling architectures under realistic noise. The architecture achieves logical gate times of approximately 100 us and quantum-error-correction cycle times of about 1 ms for code distances d<12. These results establish static atomic buses as a practical alternative to atom shuttling for scalable fault-tolerant neutral-atom quantum computing.

quant-pharXiv:2607.02804•PRX Quantum•Jul 6, 2026•2 citations

Scalable Generation of Cluster State with Superconducting Circuit

佐藤, 貴彦

Recently, fault tolerant quantum computation such as surface coding and topological quantum computation has been paid attention to due to high threshold against computational errors compared with that of conventional gate-model quantum computation.These schemes use a two or three-dimensional cluster state as universal resources for quantum computation.We can generate a cluster state by performing controlled-phase gates on an initial state prepared in |+⟩ state, where the control-phase gates are realized by nearest neighbor Ising type interactions.There are many proposal to realize Ising type interaction such as ultracold atoms in an optical lattice, superconducting charge qubits, superconducting spin qubits, resonator wave guides, nitrogen-vacancy centers, and quantum dots.Among many candidates, we especially discuss superconducting flux qubits.Superconducting flux qubits have a strong anharmonicity, so that we can perform high-speed single-qubit rotation with excellent fidelity.Usually, implementation of high-fidelity two-qubit gates is the hardest part for the realization of quantum computation.Two qubit gates require in-situ turn on/off the interaction between qubits by the external control apparatus.Since imperfection of the interaction control tends to induce spatially correlated errors between qubits, sophisticated technology is required to suppress such error rate below the threshold of fault tolerant quantum computation.Up to now, the generation of a large cluster state using solid-state qubit has not been demonstrated in a scalable manner yet.One of the main obstacles is the requirement for independent control of two-qubit gates that are necessary for the scalable quantum information processing.For a superconducting flux qubit, existing method uses applied magnetic field to control the interaction.It is known that the application of magnetic field to local area is difficult.Thus, it is hard to implement local control of the interaction without cross-talk problem where unwanted errors occurs between qubits.Firstly, we propose a novel way to control a number of two-qubit gates independently without using the on/off switching of locally applied magnetic field.Specifically, we assume the superconducting flux qubits that are inductively coupled with each other via always-on Ising interaction.Unlike the previous method to change the interaction strength with unitary operations, we fully make use of non-unitary properties of projective measurements so that we can effectively turn on/off the interaction via quantum feedforward.Also, we show how to generate a two or three-dimensional cluster state that are universal resource for fault tolerant quantum computation with constant stepsize operations.The on/off switching of locally applied magnetic field is not necessary to First of all, I would like to thank my adviser Professor Hiroshi Imai for his valuable comments and continuous support during the last five years.

•Jul 21, 2016•0 citations

Long-range tunable coupler for modular fluxonium quantum processors

Peng Zhao, Peng Xu, Zheng-Yuan Xue

The path toward practical superconducting quantum processors requires the integration of a large number of high-performance qubits. Modular architectures could offer a way to address the scaling limitations of monolithic designs by partitioning a large quantum processor into physically separated modules, or chiplets, linked through long-range interconnects. In this context, although fluxonium qubits have emerged as a compelling platform for quantum computing due to their long coherence times and high-fidelity gates, existing coupling schemes remain restricted to qubits in close proximity on a single chip. This limitation inherently precludes the long-range interconnects essential for modular integration. In this work, we propose a long-range tunable coupler designed to interconnect fluxonium qubits separated by more than one centimeter, thereby supporting the realization of modular fluxonium quantum processors. Under realistic assumptions, the proposed coupler has the potential to achieve inter-module two-qubit gate performance, specifically sub-100-ns gates with intrinsic errors below $10^{-4}$, comparable to that of intra-module (intra-chiplet) gates, while enabling modular integration with low quantum crosstalk, a key requirement for scalable systems. We further discuss the integration of this coupler into modular fluxonium lattices and explore its feasibility for achieving the higher connectivity and longer coupling range required for complex quantum error correction codes. This work could contribute to the development of large-scale fluxonium quantum processors by bridging their demonstrated potential with modular scalability.

quant-pharXiv:2604.12261•Apr 15, 2026•3 citations

Architectures

Jacob M. Taylor

The principles of fault tolerance In this chapter we will consider some of the practical difficulties in building a large-scale quantum computing device. This discussion relies heavily upon the prior chapters that introduced faulttolerant quantum computation. Assuming that fault tolerance is possible allows us to focus on the physical realization of these ideas with a few specific examples. Before going into detail, we review the governing ideas behind any fault-tolerant architecture. These are the necessary components that we analyze in this chapter: good quantum memory, high-fidelity quantum operations, long-range quantum gates, and highly parallel operation, such that error correction in different sections of the device can be accomplished at the same time. While a wide variety of potential implementations may be possible, the goal of a fault-tolerant architecture is not only to be scalable, i.e., to be able to run an arbitrarily large computation with at most polynomial overhead [S95, S96e], but also to be as efficient as possible. Efficiency in this context means using the fewest physical resources (quantum bits, time, control operations) necessary to accomplish the desired computation [S03b]. From this perspective, the recipe for fault tolerance is well established. First, we need to identify what quantum operations are available for the various quantum bits at our disposal. Developing error models for these operations forms the bulk of this chapter. Important questions about operations include noise, implementation time, and bandwidth (how many such operations may be performed in parallel).

Cambridge University Press eBooks•Sep 5, 2013•0 citations

Efficient Routing of Quantum LDPC Codes on Programmable 2D Toric Architectures

Kun Liu, Takahiro Tsunoda, Sophia H. Xue +5 more

Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from $O(n)$ to $O(\sqrt{n})$. Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06\% for $[[18, 4, 4]]$ BB code, 2.6$\times$ less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.

quant-pharXiv:2604.18714•Apr 22, 2026•3 citations
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 by Plourde et al. [Phys. Rev. B 70, 140501(R) (2004)] and extend it to allow approximately 500MHz500\phantom{\rule{0.3em}{0ex}}\mathrm{MHz}500MHz coupling of square flux qubits, 50\ensuremathμm50\phantom{\rule{0.3em}{0ex}}\ensuremath{\mu}\mathrm{m}50\ensuremathμm a side, at a distance of up to several millimeters. This mechanism is then used as the basis of two scalable architectures for flux qubits taking into account cross-talk and fault-tolerant considerations such as permitting a universal set of logical gates, parallelism, measurement and initialization, and data mobility.
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 under-appreciated 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 Plourde et al. (Phys. Rev. B, 70, 140501(R) (2004)) and extend it to allow approximately 500~MHz coupling of square flux qubits, 50 µm 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.PACS No.: 03.67.Lx
Efficient quantum error correction and fault-tolerant quantum computing require scalable, high-fidelity long-range connectivity. In neutral-atom quantum computers, this is commonly achieved through atom transport, but shuttling introduces latency and motional heating that worsen with system size. Here, we introduce a neutral-atom architecture based on static atomic buses, in which auxiliary mediator atoms enable long-range entangling operations without qubit transport. The architecture naturally supports long-range stabilizer measurements in high-rate LDPC codes and transversal logical gates between neighboring surface-code patches, enabling a modular framework for efficient logical memories, Clifford computation, and magic-state distillation. To realize these capabilities, we co-design optimal-control protocols for bus-mediated controlled-Z gates that incorporate both microscopic neutral-atom dynamics and architectural constraints. We obtain smooth bus-mediated gates with fidelities approaching 99.9% and durations of a few hundred nanoseconds by combining time-optimal control with interaction-flatness and robustness constraints. Large-scale simulations of quantum error correction and logical entangling operations between neighboring surface-code patches predict more than an order-of-magnitude improvement in logical error rates compared with atom-shuttling architectures under realistic noise. The architecture achieves logical gate times of approximately 100 us and quantum-error-correction cycle times of about 1 ms for code distances d<12. These results establish static atomic buses as a practical alternative to atom shuttling for scalable fault-tolerant neutral-atom quantum computing.
Recently, fault tolerant quantum computation such as surface coding and topological quantum computation has been paid attention to due to high threshold against computational errors compared with that of conventional gate-model quantum computation.These schemes use a two or three-dimensional cluster state as universal resources for quantum computation.We can generate a cluster state by performing controlled-phase gates on an initial state prepared in |+⟩ state, where the control-phase gates are realized by nearest neighbor Ising type interactions.There are many proposal to realize Ising type interaction such as ultracold atoms in an optical lattice, superconducting charge qubits, superconducting spin qubits, resonator wave guides, nitrogen-vacancy centers, and quantum dots.Among many candidates, we especially discuss superconducting flux qubits.Superconducting flux qubits have a strong anharmonicity, so that we can perform high-speed single-qubit rotation with excellent fidelity.Usually, implementation of high-fidelity two-qubit gates is the hardest part for the realization of quantum computation.Two qubit gates require in-situ turn on/off the interaction between qubits by the external control apparatus.Since imperfection of the interaction control tends to induce spatially correlated errors between qubits, sophisticated technology is required to suppress such error rate below the threshold of fault tolerant quantum computation.Up to now, the generation of a large cluster state using solid-state qubit has not been demonstrated in a scalable manner yet.One of the main obstacles is the requirement for independent control of two-qubit gates that are necessary for the scalable quantum information processing.For a superconducting flux qubit, existing method uses applied magnetic field to control the interaction.It is known that the application of magnetic field to local area is difficult.Thus, it is hard to implement local control of the interaction without cross-talk problem where unwanted errors occurs between qubits.Firstly, we propose a novel way to control a number of two-qubit gates independently without using the on/off switching of locally applied magnetic field.Specifically, we assume the superconducting flux qubits that are inductively coupled with each other via always-on Ising interaction.Unlike the previous method to change the interaction strength with unitary operations, we fully make use of non-unitary properties of projective measurements so that we can effectively turn on/off the interaction via quantum feedforward.Also, we show how to generate a two or three-dimensional cluster state that are universal resource for fault tolerant quantum computation with constant stepsize operations.The on/off switching of locally applied magnetic field is not necessary to First of all, I would like to thank my adviser Professor Hiroshi Imai for his valuable comments and continuous support during the last five years.
The path toward practical superconducting quantum processors requires the integration of a large number of high-performance qubits. Modular architectures could offer a way to address the scaling limitations of monolithic designs by partitioning a large quantum processor into physically separated modules, or chiplets, linked through long-range interconnects. In this context, although fluxonium qubits have emerged as a compelling platform for quantum computing due to their long coherence times and high-fidelity gates, existing coupling schemes remain restricted to qubits in close proximity on a single chip. This limitation inherently precludes the long-range interconnects essential for modular integration. In this work, we propose a long-range tunable coupler designed to interconnect fluxonium qubits separated by more than one centimeter, thereby supporting the realization of modular fluxonium quantum processors. Under realistic assumptions, the proposed coupler has the potential to achieve inter-module two-qubit gate performance, specifically sub-100-ns gates with intrinsic errors below 10−410^{-4}10−4, comparable to that of intra-module (intra-chiplet) gates, while enabling modular integration with low quantum crosstalk, a key requirement for scalable systems. We further discuss the integration of this coupler into modular fluxonium lattices and explore its feasibility for achieving the higher connectivity and longer coupling range required for complex quantum error correction codes. This work could contribute to the development of large-scale fluxonium quantum processors by bridging their demonstrated potential with modular scalability.
The principles of fault tolerance In this chapter we will consider some of the practical difficulties in building a large-scale quantum computing device. This discussion relies heavily upon the prior chapters that introduced faulttolerant quantum computation. Assuming that fault tolerance is possible allows us to focus on the physical realization of these ideas with a few specific examples. Before going into detail, we review the governing ideas behind any fault-tolerant architecture. These are the necessary components that we analyze in this chapter: good quantum memory, high-fidelity quantum operations, long-range quantum gates, and highly parallel operation, such that error correction in different sections of the device can be accomplished at the same time. While a wide variety of potential implementations may be possible, the goal of a fault-tolerant architecture is not only to be scalable, i.e., to be able to run an arbitrarily large computation with at most polynomial overhead [S95, S96e], but also to be as efficient as possible. Efficiency in this context means using the fewest physical resources (quantum bits, time, control operations) necessary to accomplish the desired computation [S03b]. From this perspective, the recipe for fault tolerance is well established. First, we need to identify what quantum operations are available for the various quantum bits at our disposal. Developing error models for these operations forms the bulk of this chapter. Important questions about operations include noise, implementation time, and bandwidth (how many such operations may be performed in parallel).
Quantum low-density parity-check codes are promising candidates towards scalable fault-tolerant quantum computation. Among these, bivariate bicycle (BB) codes offer superior encoding rates and large code distance compared to surface codes. However, their requirement on long-range stabilizer measurements poses significant challenges for implementation on realistic hardware with limited connectivity, such as superconducting circuit platforms. In this work, we introduce a novel hardware-software co-design that leverages a programmable communication network architecture to address these limitations. Our approach utilizes a 2D toric network of oscillators as a flexible communication fabric linking qubits at each site. Such architecture significantly reduces the number of long-range couplers required from O(n)O(n)O(n) to O(n)O(\sqrt{n})O(n​). Dual-rail qubits, along with native gates including Swap-Wait-Swap gates and beamsplitter SWAPs, ensure that long-range two-qubit gates can be executed with high fidelity and low latency. To further enhance performance, our qubit layout and routing algorithm utilize symmetries of the codes and enable maximum parallelism for long-range two-qubit gates, maintaining a low syndrome extraction cycle duration and scalability over the code length. We perform circuit-level simulation with realistic noise modeling based on experimental hardware parameters, observing an logical error rate per logical qubit per cycle of 3.06\% for [[18,4,4]][[18, 4, 4]][[18,4,4]] BB code, 2.6×\times× less than the existing experimental result. These findings provide a practical roadmap and identify key technological advancements needed to achieve low-overhead fault-tolerant quantum computing at scale.