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

Proceedings of symposia in applied mathematics

Qubit devices

Howard E. Brandt

Published Jan 1, 2002• 2 citations
Publisher
DOI
10.1090/psapm/058/1922895

Related papers

Blueprint for fault-tolerant quantum computation with topological qubit arrays

David Aasen, Morteza Aghaee, Zulfi Alam +97 more

We describe a concrete device roadmap toward a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits. Our roadmap encompasses four generations of devices: a single-qubit device that enables a measurement-based qubit benchmarking protocol; a two-qubit device that uses measurement-based braiding to perform single-qubit Clifford operations; an eight-qubit device that can be used to show an improvement of a two-qubit operation when performed on logical qubits rather than directly on physical qubits; and a topological qubit array supporting lattice surgery demonstrations on two logical qubits. Devices that enable this path require a superconductor-semiconductor heterostructure that supports a topological phase, quantum dots and coupling between those quantum dots that can create the appropriate loops for interferometric measurements, and a microwave readout system that can perform fast, low-error single-shot measurements. We describe the key design components of these qubit devices, along with the associated protocols for demonstrations of single-qubit benchmarking, Clifford gate execution, quantum error detection, and quantum error correction, which differ greatly from those in more conventional qubits. Finally, we comment on implications and advantages of this architecture for utility-scale quantum computation.

arXiv:2502.12252•Physical Review Research•Dec 10, 2025•92 citations

Silicon qubit devices

Simon Schaal, M. Fernando González-Zalba

Frontiers of nanoscience•Jan 1, 2021•0 citations

Qubit Chip

Graham P. Collins

Scientific American•Aug 1, 1999•0 citations

TWO-WAY QUANTUM-BIT-STRING COMMITMENT

Chuan-Ming Li, Tzonelih Hwang

Due to the high cost of the qubit generating device (QGD) (the single photon source), QGD may not be available at the same time in both communicating parties (Alice and Bob) who have to execute the quantum bit string commitment (QBSC) protocol for some application environments. All the existing QBSC protocols allow one-way commitment i.e., only the party (Bob) who possesses the QGD is allowed to commit a bit string to Alice who does not have the QGD, but not the other way around. However, what happens if Alice, who does not have the QGD, is required to commit a bit string to Bob? The current QBSC protocols fail to provide a solution in this case. Therefore, the purpose of this paper is to allow Alice, who is not equipped with the QGD, to commit a bit string to Bob who has the QGD. With our proposed protocol, together with previously proposed QBSC protocols, Alice and Bob can perform two-way commitment, even though Bob is the only party who is equipped with the QGD.

International Journal of Modern Physics B•Apr 20, 2010•0 citations

An Efficient Routing Optimization Framework for Silicon-Based Spin-Qubit Devices

ChingYao Huang, Wai-Kei Mak

Advanced silicon-based spin-qubit chips are being developed by the industry because of its promising scalability for large-scale quantum computing. The silicon-based fabrication of spin-qubit devices allows them to scale to thousands of qubits while maintaining a relatively small area compared to other quantum technologies such as superconducting or neutral atom. However, the unique characteristics of spin-qubit devices limit the applicability of existing qubit routing methods developed for other quantum devices, and the state-of-the-art routing approach for spin-qubit devices overlooks some key factors, leading to suboptimal solution quality. We introduce a novel routing method for spin-qubit devices that leverages Dijkstra’s algorithm and breadth-first search to determine the routing path for the operand qubit(s) of each gate. To avoid redundant computations for routing paths, we determine the routing region for each gate and represent it as a bit vector, which enables efficient overlap checking between routing regions. We performed experiments on four benchmark sets, including circuits with up to 1617 qubits and more than 700,000 gates. These benchmark sets cover a wide range of quantum circuits, including reversible arithmetic, algorithmic, synthesized, and random circuits. Our proposed method resulted in high-quality routing solutions and outperformed the state-of-the-art qubit routing approach on spin-qubit devices with over 29% and 7% reduction in operation overhead and depth overhead, respectively.

•Oct 26, 2025•0 citations

Solid-State Qubits

David S. Simon

Undergraduate texts in physics•Jan 1, 2025•1 citation
We describe a concrete device roadmap toward a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits. Our roadmap encompasses four generations of devices: a single-qubit device that enables a measurement-based qubit benchmarking protocol; a two-qubit device that uses measurement-based braiding to perform single-qubit Clifford operations; an eight-qubit device that can be used to show an improvement of a two-qubit operation when performed on logical qubits rather than directly on physical qubits; and a topological qubit array supporting lattice surgery demonstrations on two logical qubits. Devices that enable this path require a superconductor-semiconductor heterostructure that supports a topological phase, quantum dots and coupling between those quantum dots that can create the appropriate loops for interferometric measurements, and a microwave readout system that can perform fast, low-error single-shot measurements. We describe the key design components of these qubit devices, along with the associated protocols for demonstrations of single-qubit benchmarking, Clifford gate execution, quantum error detection, and quantum error correction, which differ greatly from those in more conventional qubits. Finally, we comment on implications and advantages of this architecture for utility-scale quantum computation.
Due to the high cost of the qubit generating device (QGD) (the single photon source), QGD may not be available at the same time in both communicating parties (Alice and Bob) who have to execute the quantum bit string commitment (QBSC) protocol for some application environments. All the existing QBSC protocols allow one-way commitment i.e., only the party (Bob) who possesses the QGD is allowed to commit a bit string to Alice who does not have the QGD, but not the other way around. However, what happens if Alice, who does not have the QGD, is required to commit a bit string to Bob? The current QBSC protocols fail to provide a solution in this case. Therefore, the purpose of this paper is to allow Alice, who is not equipped with the QGD, to commit a bit string to Bob who has the QGD. With our proposed protocol, together with previously proposed QBSC protocols, Alice and Bob can perform two-way commitment, even though Bob is the only party who is equipped with the QGD.
Advanced silicon-based spin-qubit chips are being developed by the industry because of its promising scalability for large-scale quantum computing. The silicon-based fabrication of spin-qubit devices allows them to scale to thousands of qubits while maintaining a relatively small area compared to other quantum technologies such as superconducting or neutral atom. However, the unique characteristics of spin-qubit devices limit the applicability of existing qubit routing methods developed for other quantum devices, and the state-of-the-art routing approach for spin-qubit devices overlooks some key factors, leading to suboptimal solution quality. We introduce a novel routing method for spin-qubit devices that leverages Dijkstra’s algorithm and breadth-first search to determine the routing path for the operand qubit(s) of each gate. To avoid redundant computations for routing paths, we determine the routing region for each gate and represent it as a bit vector, which enables efficient overlap checking between routing regions. We performed experiments on four benchmark sets, including circuits with up to 1617 qubits and more than 700,000 gates. These benchmark sets cover a wide range of quantum circuits, including reversible arithmetic, algorithmic, synthesized, and random circuits. Our proposed method resulted in high-quality routing solutions and outperformed the state-of-the-art qubit routing approach on spin-qubit devices with over 29% and 7% reduction in operation overhead and depth overhead, respectively.