Shuttling for Scalable Trapped-Ion Quantum Computers
- URL: http://arxiv.org/abs/2402.14065v1
- Date: Wed, 21 Feb 2024 19:00:04 GMT
- Title: Shuttling for Scalable Trapped-Ion Quantum Computers
- Authors: Daniel Schoenberger, Stefan Hillmich, Matthias Brandl, Robert Wille
- Abstract summary: Trapped-ion quantum computers exhibit promising potential to provide platforms for high-quality qubits and reliable quantum computation.
This paper proposes an efficient shuttling schedule, which orchestrates the movement operations within the device.
Even for large-scale QCCD devices, the empirical evaluation shows promising results with respect to the quality of the solution as well as performance.
- Score: 3.1066111470235462
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Trapped-ion quantum computers exhibit promising potential to provide
platforms for high-quality qubits and reliable quantum computation. The Quantum
Charge Coupled Device (QCCD) architecture offers a modular solution to enable
the realization of scalable quantum computers, paving the way for practical
quantum algorithms with large qubit numbers. Within these devices, ions can be
shuttled (moved) throughout the trap and through different dedicated zones,
e.g., a memory zone for storage and a processing zone for the actual
computation. However, due to the decoherence of the ions' quantum states, the
qubits lose their quantum information over time. Thus, the required time steps
of shuttling operations should be minimized. In this paper, we propose a
heuristic approach to finding an efficient shuttling schedule, which
orchestrates the movement operations within the device. Given a quantum
algorithm and a device architecture, the proposed algorithm produces shuttling
schedules with a close-to-minimal amount of time steps for small-size QCCD
architectures. Furthermore, even for large-scale QCCD devices, the empirical
evaluation shows promising results with respect to the quality of the solution
as well as performance.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
Quantum computers have the potential to solve intractable problems.
One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems.
In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
arXiv Detail & Related papers (2024-06-05T18:00:01Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Using Boolean Satisfiability for Exact Shuttling in Trapped-Ion Quantum
Computers [3.1066111470235462]
Trapped ions are a promising technology for building scalable quantum computers.
We propose a formalization of the possible movements in ion traps via Boolean satisfiability.
This formalization allows for determining the minimal number of time steps needed for a given quantum algorithm and device architecture.
arXiv Detail & Related papers (2023-11-06T19:00:22Z) - QuBEC: Boosting Equivalence Checking for Quantum Circuits with QEC
Embedding [4.15692939468851]
We propose a Decision Diagram-based quantum equivalence checking approach, QuBEC, that requires less latency compared to existing techniques.
Our proposed methodology reduces verification time on certain benchmark circuits by up to $271.49 times$.
arXiv Detail & Related papers (2023-09-19T16:12:37Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Quantum Volume for Photonic Quantum Processors [15.3862808585761]
Defining metrics for near-term quantum computing processors has been an integral part of the quantum hardware research and development efforts.
Most metrics such as randomized benchmarking and quantum volume were originally introduced for circuit-based quantum computers.
We present a framework to map physical noises and imperfections in MBQC processes to logical errors in equivalent quantum circuits.
arXiv Detail & Related papers (2022-08-24T18:05:16Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - A divide-and-conquer algorithm for quantum state preparation [2.2596039727344457]
We show that it is possible to load an N-dimensional vector with a quantum circuit with polylogarithmic depth and entangled information in ancillary qubits.
Results show that we can efficiently load data in quantum devices using a divide-and-conquer strategy to exchange computational time for space.
arXiv Detail & Related papers (2020-08-04T13:26:07Z)
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.