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:1708.09283 · IEEE/ACM International Symposium on Microarchitecture (MICRO)

Optimized surface code communication in superconducting quantum computers

Ali Javadi-Abhari, Pranav Gokhale, Adam A. Holmes, Diana M. Franklin, Kenneth R. Brown, Margaret Martonosi, Frederic T. Chong

Published Oct 14, 2017• 69 citations
arXivHTMLPDF

Abstract

Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [30, 73], and several-hundred-qubit machines are around the corner. Machines of this scale have the capacity to demonstrate quantum supremacy, the tipping point where QC is faster than the fastest classical alternative for a particular problem. Because error correction techniques will be central to QC and will be the most expensive component of quantum computation, choosing the lowest-overhead error correction scheme is critical to overall QC success. This paper evaluates two established quantum error correction codes---planar and double-defect surface codes---using a set of compilation, scheduling and network simulation tools. In considering scalable methods for optimizing both codes, we do so in the context of a full microarchitectural and compiler analysis. Contrary to previous predictions, we find that the simpler planar codes are sometimes more favorable for implementation on superconducting quantum computers, especially under conditions of high communication congestion.

DOI
10.1145/3123939.3123949

Related papers

Dependency-Aware Compilation for Surface Code Quantum Architectures

Abtin Molavi, Amanda Xu, Swamit Tannu +1 more

Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum circuits for quantum computers implementing surface codes. Optimal or near-optimal compilation is critical for both efficiency and correctness. The compilation problem requires (1) mapping circuit qubits to the device qubits and (2) routing execution paths between interacting qubits. We solve this problem efficiently and near-optimally with a novel algorithm that exploits the dependency structure of circuit operations to formulate discrete optimization problems that can be approximated via simulated annealing, a classic and simple algorithm. Our extensive evaluation shows that our approach is powerful and flexible for compiling realistic workloads.

arXiv:2311.18042•Proceedings of the ACM on Programming Languages•Apr 9, 2025•37 citations

Pseudo-2D superconducting quantum computing circuit for the surface code: proposal and preliminary tests

Hiroto Mukai, Keiichi Sakata, Simon J. Devitt +4 more

Abstract Among the major hardware platforms for large-scale quantum computing, one of the leading candidates is superconducting quantum circuits. Current proposed architectures for quantum error-correction with the promising surface code require a two-dimensional layout of superconducting qubits with nearest-neighbor interactions. A major hurdle for the scalability in such an architecture using superconducting systems is the so-called wiring problem, where qubits internal to a chipset become difficult to access by the external control/readout lines. In contrast to the existing approaches which address the problem through intricate three-dimensional wiring and packaging technology, leading to a significant engineering challenge, here we address this problem by presenting a modified microarchitecture in which all the wiring can be realized through a newly introduced pseudo two-dimensional resonator network which provides the inter-qubit connections via airbridges. Our proposal is completely compatible with current standard planar circuit technology. We carried out experiments to examine the feasibility of the new airbridge component. The measured quality factor of the airbridged resonator is below the simulated surface-code threshold required for a coupling resonator, and it should not limit simulated gate fidelity. The measured crosstalk between crossed resonators is at most −49 dB in resonance. Further spatial and frequency separation between the resonators should result in relatively limited crosstalk between them, which would not increase as the size of the chipset increases. This architecture and the preliminary tests indicate the possibility that a large-scale, fully error-corrected quantum computer could be constructed by monolithic integration technologies without additional overhead or special packaging know-how.

arXiv:1902.07911•New Journal of Physics•Apr 1, 2020•32 citations

Topological quantum error correction and quantum algorithm simulations

David Wang

Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit.Unlike the bit, quantum mechanics allows a qubit to be in a linear superposition of both its basis states.Given the same number of bits and qubits, the latter stores exponentially more information.Quantum algorithms exploit these superposition states, allowing quantum computers to solve problems such as prime number factorisation and searches faster than classical computers.Realising a large-scale quantum computer is difficult because quantum information is highly susceptible to noise.Error correction may be employed to suppress the noise, so that the results of large quantum algorithms are valid.The overhead incurred from introducing error correction is neutralised if all elementary quantum operations are constructed with an error rate below some threshold error rate.Below threshold, arbitrary length quantum computation is possible.We investigate two topological quantum error correcting codes, the planar code and the 2D colour code.We find the threshold for the 2D colour code to be 0.1%, and improve the planar code threshold from 0.75% to 1.1%.Existing protocols for the transmission of quantum states are hindered by maximum communication distances and low communication rates.We adapt the planar code for use in quantum communication, and show that this allows the fault-tolerant transmission of quantum information over arbitrary distances at a rate limited only by local quantum gate speed.Error correction is an expensive investment and thus one seeks to employ as little as possible without compromising the integrity of the results.It is therefore important to study the robustness of algorithms to noise.We show that using the matrix product state representation allows one to simulate far larger instances of the quantum factoring algorithm than under the traditional amplitude formalism representation.We simulate systems with as many as 42 qubits on a single processor with 32GB RAM, comparable to amplitude formalism simulations performed on far larger computers.

•Jan 1, 2011•0 citations

Surface code quantum computing by lattice surgery

Dominic C. Horsman, Austin G. Fowler, Simon J. Devitt +1 more

Abstract In recent years, surface codes have become a leading method for quantum error correction in theoretical large-scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural two-dimensional nearest-neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect-based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance-3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.

arXiv:1111.4022•New Journal of Physics•Dec 1, 2012•735 citations

Benchmarking and Analysis of Quantum Error Correction Codes

Rohan Timmaraju

Quantum Computing is a computing framework that takes advantage of unique quantum mechanical properties (such as superposition and entanglement) to perform calculations and implement algorithms that could offer exponential speed-ups over classical computing. However, in physical implementations of such quantum computers, qubits – the fundamental components of these systems – can accumulate errors that must be accounted for. In order to mitigate these errors, various quantum error correction (QEC) codes have been developed, including the repetition code and surface codes. In this experiment I implement and evaluate three types of QEC codes on the Qiskit simulator to compare their efficacy and applicability in correcting for different kinds of errors. I hypothesize that surface codes, with their more effective design and range of correction methods, should perform the best with much lower error thresholds and resultant logical error rates. The results support the hypothesis and suggest that surface codes are a viable method of implementing scalable error correction in quantum computers.

Journal of Student Research•Aug 31, 2023•0 citations

Hardness of Braided Quantum Circuit Optimization in the Surface Code

Kunihiro Wasa, S. Nishio, Koki Suetsugu +4 more

Large-scale quantum information processing requires the use of quantum error correcting codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates as they can be implemented using only local interactions in a twodimensional array of physical qubits. Procedures such as defect braiding and lattice surgery can then be used to realize a fault-tolerant universal set of gates on the logical space of such topological codes. However, error correction also introduces a significant overhead in computation time, the number of physical qubits, and the number of physical gates. While optimizing fault-tolerant circuits to minimize this overhead is critical, the computational complexity of such optimization problems remains unknown. This ambiguity leaves room for doubt surrounding the most effective methods for compiling fault-tolerant circuits for a large-scale quantum computer. In this paper, we show that the optimization of a special subset of braided quantum circuits is NP-hard by a polynomial-time reduction of the optimization problem into a specific problem called PlanarRectilinear3SAT.

arXiv:2302.00273•IEEE Transactions on Quantum Engineering•Jan 1, 2023•7 citations
Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [30, 73], and several-hundred-qubit machines are around the corner. Machines of this scale have the capacity to demonstrate quantum supremacy, the tipping point where QC is faster than the fastest classical alternative for a particular problem. Because error correction techniques will be central to QC and will be the most expensive component of quantum computation, choosing the lowest-overhead error correction scheme is critical to overall QC success. This paper evaluates two established quantum error correction codes---planar and double-defect surface codes---using a set of compilation, scheduling and network simulation tools. In considering scalable methods for optimizing both codes, we do so in the context of a full microarchitectural and compiler analysis. Contrary to previous predictions, we find that the simpler planar codes are sometimes more favorable for implementation on superconducting quantum computers, especially under conditions of high communication congestion.
Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum circuits for quantum computers implementing surface codes. Optimal or near-optimal compilation is critical for both efficiency and correctness. The compilation problem requires (1) mapping circuit qubits to the device qubits and (2) routing execution paths between interacting qubits. We solve this problem efficiently and near-optimally with a novel algorithm that exploits the dependency structure of circuit operations to formulate discrete optimization problems that can be approximated via simulated annealing, a classic and simple algorithm. Our extensive evaluation shows that our approach is powerful and flexible for compiling realistic workloads.
Abstract Among the major hardware platforms for large-scale quantum computing, one of the leading candidates is superconducting quantum circuits. Current proposed architectures for quantum error-correction with the promising surface code require a two-dimensional layout of superconducting qubits with nearest-neighbor interactions. A major hurdle for the scalability in such an architecture using superconducting systems is the so-called wiring problem, where qubits internal to a chipset become difficult to access by the external control/readout lines. In contrast to the existing approaches which address the problem through intricate three-dimensional wiring and packaging technology, leading to a significant engineering challenge, here we address this problem by presenting a modified microarchitecture in which all the wiring can be realized through a newly introduced pseudo two-dimensional resonator network which provides the inter-qubit connections via airbridges. Our proposal is completely compatible with current standard planar circuit technology. We carried out experiments to examine the feasibility of the new airbridge component. The measured quality factor of the airbridged resonator is below the simulated surface-code threshold required for a coupling resonator, and it should not limit simulated gate fidelity. The measured crosstalk between crossed resonators is at most −49 dB in resonance. Further spatial and frequency separation between the resonators should result in relatively limited crosstalk between them, which would not increase as the size of the chipset increases. This architecture and the preliminary tests indicate the possibility that a large-scale, fully error-corrected quantum computer could be constructed by monolithic integration technologies without additional overhead or special packaging know-how.
Quantum computers are machines that manipulate quantum information stored in the form of qubits, the quantum analogue to the classical bit.Unlike the bit, quantum mechanics allows a qubit to be in a linear superposition of both its basis states.Given the same number of bits and qubits, the latter stores exponentially more information.Quantum algorithms exploit these superposition states, allowing quantum computers to solve problems such as prime number factorisation and searches faster than classical computers.Realising a large-scale quantum computer is difficult because quantum information is highly susceptible to noise.Error correction may be employed to suppress the noise, so that the results of large quantum algorithms are valid.The overhead incurred from introducing error correction is neutralised if all elementary quantum operations are constructed with an error rate below some threshold error rate.Below threshold, arbitrary length quantum computation is possible.We investigate two topological quantum error correcting codes, the planar code and the 2D colour code.We find the threshold for the 2D colour code to be 0.1%, and improve the planar code threshold from 0.75% to 1.1%.Existing protocols for the transmission of quantum states are hindered by maximum communication distances and low communication rates.We adapt the planar code for use in quantum communication, and show that this allows the fault-tolerant transmission of quantum information over arbitrary distances at a rate limited only by local quantum gate speed.Error correction is an expensive investment and thus one seeks to employ as little as possible without compromising the integrity of the results.It is therefore important to study the robustness of algorithms to noise.We show that using the matrix product state representation allows one to simulate far larger instances of the quantum factoring algorithm than under the traditional amplitude formalism representation.We simulate systems with as many as 42 qubits on a single processor with 32GB RAM, comparable to amplitude formalism simulations performed on far larger computers.
Abstract In recent years, surface codes have become a leading method for quantum error correction in theoretical large-scale computational and communications architecture designs. Their comparatively high fault-tolerant thresholds and their natural two-dimensional nearest-neighbour (2DNN) structure make them an obvious choice for large scale designs in experimentally realistic systems. While fundamentally based on the toric code of Kitaev, there are many variants, two of which are the planar- and defect-based codes. Planar codes require fewer qubits to implement (for the same strength of error correction), but are restricted to encoding a single qubit of information. Interactions between encoded qubits are achieved via transversal operations, thus destroying the inherent 2DNN nature of the code. In this paper we introduce a new technique enabling the coupling of two planar codes without transversal operations, maintaining the 2DNN of the encoded computer. Our lattice surgery technique comprises splitting and merging planar code surfaces, and enables us to perform universal quantum computation (including magic state injection) while removing the need for braided logic in a strictly 2DNN design, and hence reduces the overall qubit resources for logic operations. Those resources are further reduced by the use of a rotated lattice for the planar encoding. We show how lattice surgery allows us to distribute encoded GHZ states in a more direct (and overhead friendly) manner, and how a demonstration of an encoded CNOT between two distance-3 logical states is possible with 53 physical qubits, half of that required in any other known construction in 2D.
Quantum Computing is a computing framework that takes advantage of unique quantum mechanical properties (such as superposition and entanglement) to perform calculations and implement algorithms that could offer exponential speed-ups over classical computing. However, in physical implementations of such quantum computers, qubits – the fundamental components of these systems – can accumulate errors that must be accounted for. In order to mitigate these errors, various quantum error correction (QEC) codes have been developed, including the repetition code and surface codes. In this experiment I implement and evaluate three types of QEC codes on the Qiskit simulator to compare their efficacy and applicability in correcting for different kinds of errors. I hypothesize that surface codes, with their more effective design and range of correction methods, should perform the best with much lower error thresholds and resultant logical error rates. The results support the hypothesis and suggest that surface codes are a viable method of implementing scalable error correction in quantum computers.
Large-scale quantum information processing requires the use of quantum error correcting codes to mitigate the effects of noise in quantum devices. Topological error-correcting codes, such as surface codes, are promising candidates as they can be implemented using only local interactions in a twodimensional array of physical qubits. Procedures such as defect braiding and lattice surgery can then be used to realize a fault-tolerant universal set of gates on the logical space of such topological codes. However, error correction also introduces a significant overhead in computation time, the number of physical qubits, and the number of physical gates. While optimizing fault-tolerant circuits to minimize this overhead is critical, the computational complexity of such optimization problems remains unknown. This ambiguity leaves room for doubt surrounding the most effective methods for compiling fault-tolerant circuits for a large-scale quantum computer. In this paper, we show that the optimization of a special subset of braided quantum circuits is NP-hard by a polynomial-time reduction of the optimization problem into a specific problem called PlanarRectilinear3SAT.