Ion Coulomb Crystals in Storage Rings for Quantum Information Science
- URL: http://arxiv.org/abs/2203.06809v2
- Date: Tue, 15 Mar 2022 16:46:51 GMT
- Title: Ion Coulomb Crystals in Storage Rings for Quantum Information Science
- Authors: S. Brooks, K. Brown, F. M\'eot, A. Nomerotski, S. Peggs, M. Palmer, T.
Roser, T. Shaftan, G. H. Hoffstaetter, S. Nagaitsev, J. Lykken, J. Jarvis, V.
Lebedev, G. Stancari, A. Valishev, A. Taylor, A. Hurd, N. Moody, P. Muggli,
A. Aslam, S. G. Biedron, T. Bolin, S. Sosa Guitron, C. Gonzalez-Zacarias, M.
Larsson, R. Thomas, B. Huang, T. Robertazzi, J. Cary, B. M. Hegelich, B. B.
Blinov, S. Milton
- Abstract summary: Quantum information science promises to take computing into a new age of higher performance and larger scale computing.
The outstanding issue in practical quantum computing today is scaling up the system while maintaining interconnectivity of the qubits.
A circular radio-frequency quadrupole acts as a large circular ion trap and could enable larger scale quantum computing.
- Score: 0.1421245849212703
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum information science is a growing field that promises to take
computing into a new age of higher performance and larger scale computing as
well as being capable of solving problems classical computers are incapable of
solving. The outstanding issue in practical quantum computing today is scaling
up the system while maintaining interconnectivity of the qubits and low error
rates in qubit operations to be able to implement error correction and
fault-tolerant operations. Trapped ion qubits offer long coherence times that
allow error correction. However, error correction algorithms require large
numbers of qubits to work properly. We can potentially create many thousands
(or more) of qubits with long coherence states in a storage ring. For example,
a circular radio-frequency quadrupole, which acts as a large circular ion trap
and could enable larger scale quantum computing. Such a Storage Ring Quantum
Computer (SRQC) would be a scalable and fault tolerant quantum information
system, composed of qubits with very long coherence lifetimes. With computing
demands potentially outpacing the supply of high-performance systems, quantum
computing could bring innovation and scientific advances to particle physics
and other DOE supported programs. Increased support of R$\&$D in large scale
ion trap quantum computers would allow the timely exploration of this exciting
new scalable quantum computer. The R$\&$D program could start immediately at
existing facilities and would include the design and construction of a
prototype SRQC. We invite feedback from and collaboration with the particle
physics and quantum information science communities.
Related papers
- Beyond NISQ: The Megaquop Machine [0.0]
Quantum computers with broad practical value must be protected against noise.
Recent studies of quantum error correction on actual hardware are opening a new era of quantum information processing.
What are the potential uses of these megaquop machines?
arXiv Detail & Related papers (2025-02-24T17:48:41Z) - Hardware-Efficient Fault Tolerant Quantum Computing with Bosonic Grid States in Superconducting Circuits [0.0]
This perspective manuscript describes how bosonic codes, particularly grid state encodings, offer a pathway to scalable fault-tolerant quantum computing.
By leveraging the large Hilbert space of bosonic modes, quantum error correction can operate at the single physical unit level.
We argue that it offers the shortest path to achieving fault tolerance in gate-based quantum computing processors with a MHz logical clock rate.
arXiv Detail & Related papers (2024-09-09T17:20:06Z) - The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation.
We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture.
We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
arXiv Detail & Related papers (2024-05-31T16:43:20Z) - Scaling quantum computing with dynamic circuits [0.6990493129893112]
Quantum computers process information with the laws of quantum mechanics.
Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits.
Here we overcome these limitations with error mitigated dynamic circuits and circuit-cutting to create quantum states requiring a periodic connectivity employing up to 142 qubits.
arXiv Detail & Related papers (2024-02-27T19:00:07Z) - 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) - The Quantum House Of Cards [0.0]
This article examines the difficulties that would need to be solved for quantum computers to live up to their promises.
I discuss the whole stack of technologies that has been envisioned to build a quantum computer from the top layers (the actual algorithms and associated applications) down to the very bottom ones.
arXiv Detail & Related papers (2023-12-29T11:48:51Z) - Quantum Computing Toolkit From Nuts and Bolts to Sack of Tools [0.0]
Quantum computing has the potential to provide exponential performance benefits in processing over classical computing.
It utilizes quantum mechanics phenomena (such as superposition, entanglement, and interference) to solve a computational problem.
Quantum computers are in the nascent stage of development and are noisy due to decoherence, i.e., quantum bits deteriorate with environmental interactions.
arXiv Detail & Related papers (2023-02-17T14:08:44Z) - 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) - 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)
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.