Designs for a two-dimensional Si quantum dot array with spin qubit addressability

• URL: http://arxiv.org/abs/2106.11124v2
• Date: Sun, 11 Jul 2021 12:09:01 GMT
• Title: Designs for a two-dimensional Si quantum dot array with spin qubit addressability
• Authors: Masahiro Tadokoro, Takashi Nakajima, Takashi Kobayashi, Kenta Takeda, Akito Noiri, Kaito Tomari, Jun Yoneda, Seigo Tarucha, and Tetsuo Kodera
• Abstract summary: We propose a practical 3 x 3 quantum dot device design and a larger-scale design as a longer-term target. A 3 x 3 quantum dot array can execute four-qubit Grover's algorithm more efficiently than the one-dimensional counterpart. Our results showcase the possibility of medium-sized quantum processors in Si with fast quantum logic gates and long coherence times.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Electron spins in Si are an attractive platform for quantum computation, backed with their scalability and fast, high-fidelity quantum logic gates. Despite the importance of two-dimensional integration with efficient connectivity between qubits for medium- to large-scale quantum computation, however, a practical device design that guarantees qubit addressability is yet to be seen. Here, we propose a practical 3 x 3 quantum dot device design and a larger-scale design as a longer-term target. The design goal is to realize qubit connectivity to the four nearest neighbors while ensuring addressability. We show that a 3 x 3 quantum dot array can execute four-qubit Grover's algorithm more efficiently than the one-dimensional counterpart. To scale up the two-dimensional array beyond 3 x 3, we propose a novel structure with ferromagnetic gate electrodes. Our results showcase the possibility of medium-sized quantum processors in Si with fast quantum logic gates and long coherence times.

Related papers

• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
  We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
  arXiv  Detail & Related papers  (2024-06-05T17:16:07Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Realization of two-qutrit quantum algorithms on a programmable superconducting processor [0.09831489366502298]
  We show a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Bernstein-Vazirani, and Grover's search. Our results pave the way for building fully programmable ternary quantum processors using transmons as building blocks for a universal quantum computer.
  arXiv  Detail & Related papers  (2022-11-12T00:19:53Z)
• Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits [11.881366909450376]
  Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. One of the essential elements for qutrit-based quantum computation, two-qutrit quantum gate, remains a major challenge. We propose and demonstrate a highly efficient and scalable two-qutrit quantum gate in superconducting quantum circuits.
  arXiv  Detail & Related papers  (2022-06-22T16:33:58Z)
• Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer [0.0]
  Neutral atom hyperfine qubits provide inherent scalability due to their identical characteristics, long coherence times, and ability to be trapped in dense multi-dimensional arrays. We demonstrate several quantum algorithms on a programmable gate model neutral atom quantum computer in an architecture based on individual addressing of single atoms with tightly focused optical beams scanned across a two-dimensional array of qubits.
  arXiv  Detail & Related papers  (2021-12-29T15:02:43Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Experimental Demonstration of Efficient High-dimensional Quantum Gates with Orbital Angular Momentum [4.685726479038803]
  We experimentally demonstrate the four-dimensional X gate and its unique higher orders with the average conversion efficiency 93%. Our work is an important step towards the goal of achieving arbitrary high-dimensional quantum circuit and paves a way for the implementation of high-dimensional quantum communication and computation.
  arXiv  Detail & Related papers  (2020-10-11T15:20:07Z)
• Programmable Quantum Annealing Architectures with Ising Quantum Wires [2.808255698770643]
  A quantum annealer aims at preparing the ground state of an Ising spin-Hamiltonian quantum mechanically. We discuss an architecture, where the required spin interactions are implemented via two-port, or in general multi-port quantum Ising wires connecting the spins of interest. We illustrate the approach for few spin devices solving Max-Cut and prime factorization problems, and discuss the potential scaling to large atom based systems.
  arXiv  Detail & Related papers  (2020-07-31T18:00:01Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.