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:2304.00283 · Physica Scripta

Multiple silicon dangling-bond charge qubits for quantum computing: a Hilbert-space analysis of the Hamiltonian

Zahra Shaterzadeh‐Yazdi, Payman Kazemikhah

Published Jun 24, 2023• 1 citation
arXivHTMLPDF

Abstract

Abstract Silicon-based dangling-bond charge qubit is one of the auspicious models for universal fault-tolerant solid-state quantum computing. In universal quantum computing, it is crucial to evaluate and characterize the computational Hilbert space and reduce the complexity and size of the computational space. Here, we recognize this problem to understand the complexity and characteristics of the Hilbert space in our dangling-bond qubit model. The size of the desired Hilbert space can prominently be reduced by considering assumptions regarding the qubit loss. Moreover, the dimension of the desired subsets in the space shrinks by a factor of two due to the spin preservation property. Finally, the required classical memory for storage of the qubit information, Hamiltonian and Hilbert space is analysed when the number of qubits grows.

DOI
10.1088/1402-4896/ace0e2

Related papers

Dangling-bond charge qubit on a silicon surface

Lucian Livadaru, Peng Xue, Zahra Shaterzadeh‐Yazdi +5 more

Two closely spaced dangling bonds (DBs) positioned on a silicon surface and sharing an excess electron are revealed to be a strong candidate for a charge qubit. Based on our study of the coherent dynamics of this qubit, its extremely high tunneling rate ∼10 14 s -1 greatly exceeds the expected decoherence rates for a silicon-based system, thereby overcoming a critical obstacle of charge qubit quantum computing (QC). We investigate possible configurations of DB qubits for QC devices. A first-order analysis of coherent dynamics of DBs shows promise in this respect.

arXiv:0910.1797•New Journal of Physics•Aug 9, 2010•77 citations

Cavity-assisted quantum computing in a silicon nanostructure

Bao Tang, Hao Qin, Rong Zhang +2 more

We present a scheme of quantum computing with charge qubits corresponding to one excess electron shared between dangling-bond pairs of surface silicon atoms that couple to a microwave stripline resonator on a chip. By choosing a certain evolution time, we propose the realization of a set of universal single- and two-qubit logical gates. Due to its intrinsic stability and scalability, the silicon dangling-bond charge qubit can be regarded as one of the most promising candidates for quantum computation. Compared to the previous schemes on quantum computing with silicon bulk systems, our scheme shows such advantages as a long coherent time and direct control and readout.

Chinese Physics B•May 1, 2014•6 citations

A silicon-based surface code quantum computer

Joe O’Gorman, Naomi Nickerson, Philipp Ross +2 more

Abstract Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: there is a basic conflict between nanometre separation desired for qubit–qubit interactions and the much larger scales that would enable control and addressing in a manufacturable and fault-tolerant architecture. Here we resolve this conflict by establishing the feasibility of surface code quantum computing using solid-state spins, or ‘data qubits’, that are widely separated from one another. We use a second set of ‘probe’ spins that are mechanically separate from the data qubits and move in and out of their proximity. The spin dipole–dipole interactions give rise to phase shifts; measuring a probe’s total phase reveals the collective parity of the data qubits along the probe’s path. Using a protocol that balances the systematic errors due to imperfect device fabrication, our detailed simulations show that substantial misalignments can be handled within fault-tolerant operations. We conclude that this simple ‘orbital probe’ architecture overcomes many of the difficulties facing solid-state quantum computing, while minimising the complexity and offering qubit densities that are several orders of magnitude greater than other systems.

arXiv:1406.5149•npj Quantum Information•Feb 1, 2016•83 citations

Silicon photonic quantum computing with spin qubits

Xiruo Yan, Sebastian Gitt, Becky Lin +11 more

Universal quantum computing holds the promise to fundamentally change today’s information-based society, yet a hardware platform that will provide a clear path to fault-tolerant quantum computing remains elusive. One recently proposed platform involves the use of circuit-bound photons to build cluster states and perform one-way measurement-based quantum computations on arrays of long-coherence-time solid-state spin qubits. Herein, we discuss the challenges that are faced during any practical implementation of this architecture by itemizing the key physical building blocks and the constraints imposed on the spin qubits and the photonic circuit components by the requirements of fault-tolerant performance. These considerations point to silicon as a leading candidate to host such a platform, and a roadmap for developing a silicon photonic circuit-based platform for measurement-based, fault-tolerant universal quantum computing is offered.

APL Photonics•Jul 1, 2021•51 citations

Silicon CMOS architecture for a spin-based quantum computer

Menno Veldhorst, H. G. J. Eenink, C. H. Yang +1 more

Recent advances in quantum error correction codes for fault-tolerant quantum computing and physical realizations of high-fidelity qubits in multiple platforms give promise for the construction of a quantum computer based on millions of interacting qubits. However, the classical-quantum interface remains a nascent field of exploration. Here, we propose an architecture for a silicon-based quantum computer processor based on complementary metal-oxide-semiconductor (CMOS) technology. We show how a transistor-based control circuit together with charge-storage electrodes can be used to operate a dense and scalable two-dimensional qubit system. The qubits are defined by the spin state of a single electron confined in quantum dots, coupled via exchange interactions, controlled using a microwave cavity, and measured via gate-based dispersive readout. We implement a spin qubit surface code, showing the prospects for universal quantum computation. We discuss the challenges and focus areas that need to be addressed, providing a path for large-scale quantum computing.

arXiv:1609.09700•Nature Communications•Nov 20, 2017•442 citations

Quantum computing and the modified qubit

Richard B. Gomez, Anil Jayanna, Debabrata Ghoshal

As interest in quantum computing evolves, consideration must be given to the development of new methods to improve the current design of quantum computers. Such ideas are not only helping the advance towards practical quantum computation applications, but are also providing clearer understanding of quantum computation itself. Eventually, several new exploratory efforts to increase the efficiency beyond the inherent advantage of quantum computational systems to classical systems will materialize. As a part of these exploration efforts, this paper presents a modified version of the qubit, which we refer to as a "Qubit", that allows a smaller number of Qubits than qubits to reach the same result in applications such as Shor’s algorithm for the factorization of large numbers. The current model of the qubit consists of a quantum bit with two states, a zero and a one in a quantum superposition state. The Qubit, which consists of more than two states, is introduced and explained. A mathematical analysis of the Qubit within Hilbert space is given. We present examples of applications of the Qubit to several quantum computing algorithms, including discussion of the advantages and disadvantages that are involved. Finally a physical model to construct such a Qubit is considered.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 24, 2004•0 citations
Abstract Silicon-based dangling-bond charge qubit is one of the auspicious models for universal fault-tolerant solid-state quantum computing. In universal quantum computing, it is crucial to evaluate and characterize the computational Hilbert space and reduce the complexity and size of the computational space. Here, we recognize this problem to understand the complexity and characteristics of the Hilbert space in our dangling-bond qubit model. The size of the desired Hilbert space can prominently be reduced by considering assumptions regarding the qubit loss. Moreover, the dimension of the desired subsets in the space shrinks by a factor of two due to the spin preservation property. Finally, the required classical memory for storage of the qubit information, Hamiltonian and Hilbert space is analysed when the number of qubits grows.
Two closely spaced dangling bonds (DBs) positioned on a silicon surface and sharing an excess electron are revealed to be a strong candidate for a charge qubit. Based on our study of the coherent dynamics of this qubit, its extremely high tunneling rate ∼10 14 s -1 greatly exceeds the expected decoherence rates for a silicon-based system, thereby overcoming a critical obstacle of charge qubit quantum computing (QC). We investigate possible configurations of DB qubits for QC devices. A first-order analysis of coherent dynamics of DBs shows promise in this respect.
We present a scheme of quantum computing with charge qubits corresponding to one excess electron shared between dangling-bond pairs of surface silicon atoms that couple to a microwave stripline resonator on a chip. By choosing a certain evolution time, we propose the realization of a set of universal single- and two-qubit logical gates. Due to its intrinsic stability and scalability, the silicon dangling-bond charge qubit can be regarded as one of the most promising candidates for quantum computation. Compared to the previous schemes on quantum computing with silicon bulk systems, our scheme shows such advantages as a long coherent time and direct control and readout.
Abstract Individual impurity atoms in silicon can make superb individual qubits, but it remains an immense challenge to build a multi-qubit processor: there is a basic conflict between nanometre separation desired for qubit–qubit interactions and the much larger scales that would enable control and addressing in a manufacturable and fault-tolerant architecture. Here we resolve this conflict by establishing the feasibility of surface code quantum computing using solid-state spins, or ‘data qubits’, that are widely separated from one another. We use a second set of ‘probe’ spins that are mechanically separate from the data qubits and move in and out of their proximity. The spin dipole–dipole interactions give rise to phase shifts; measuring a probe’s total phase reveals the collective parity of the data qubits along the probe’s path. Using a protocol that balances the systematic errors due to imperfect device fabrication, our detailed simulations show that substantial misalignments can be handled within fault-tolerant operations. We conclude that this simple ‘orbital probe’ architecture overcomes many of the difficulties facing solid-state quantum computing, while minimising the complexity and offering qubit densities that are several orders of magnitude greater than other systems.
Universal quantum computing holds the promise to fundamentally change today’s information-based society, yet a hardware platform that will provide a clear path to fault-tolerant quantum computing remains elusive. One recently proposed platform involves the use of circuit-bound photons to build cluster states and perform one-way measurement-based quantum computations on arrays of long-coherence-time solid-state spin qubits. Herein, we discuss the challenges that are faced during any practical implementation of this architecture by itemizing the key physical building blocks and the constraints imposed on the spin qubits and the photonic circuit components by the requirements of fault-tolerant performance. These considerations point to silicon as a leading candidate to host such a platform, and a roadmap for developing a silicon photonic circuit-based platform for measurement-based, fault-tolerant universal quantum computing is offered.
Recent advances in quantum error correction codes for fault-tolerant quantum computing and physical realizations of high-fidelity qubits in multiple platforms give promise for the construction of a quantum computer based on millions of interacting qubits. However, the classical-quantum interface remains a nascent field of exploration. Here, we propose an architecture for a silicon-based quantum computer processor based on complementary metal-oxide-semiconductor (CMOS) technology. We show how a transistor-based control circuit together with charge-storage electrodes can be used to operate a dense and scalable two-dimensional qubit system. The qubits are defined by the spin state of a single electron confined in quantum dots, coupled via exchange interactions, controlled using a microwave cavity, and measured via gate-based dispersive readout. We implement a spin qubit surface code, showing the prospects for universal quantum computation. We discuss the challenges and focus areas that need to be addressed, providing a path for large-scale quantum computing.
As interest in quantum computing evolves, consideration must be given to the development of new methods to improve the current design of quantum computers. Such ideas are not only helping the advance towards practical quantum computation applications, but are also providing clearer understanding of quantum computation itself. Eventually, several new exploratory efforts to increase the efficiency beyond the inherent advantage of quantum computational systems to classical systems will materialize. As a part of these exploration efforts, this paper presents a modified version of the qubit, which we refer to as a "Qubit", that allows a smaller number of Qubits than qubits to reach the same result in applications such as Shor’s algorithm for the factorization of large numbers. The current model of the qubit consists of a quantum bit with two states, a zero and a one in a quantum superposition state. The Qubit, which consists of more than two states, is introduced and explained. A mathematical analysis of the Qubit within Hilbert space is given. We present examples of applications of the Qubit to several quantum computing algorithms, including discussion of the advantages and disadvantages that are involved. Finally a physical model to construct such a Qubit is considered.