Analog Counterdiabatic Quantum Computing
- URL: http://arxiv.org/abs/2405.14829v1
- Date: Thu, 23 May 2024 17:46:40 GMT
- Title: Analog Counterdiabatic Quantum Computing
- Authors: Qi Zhang, Narendra N. Hegade, Alejandro Gomez Cadavid, Lucas Lassablière, Jan Trautmann, Sébastien Perseguers, Enrique Solano, Loïc Henriet, Eric Michon,
- Abstract summary: We design counterdiabatic protocols to circumvent limitations via ACQC on analog quantum devices with ground-Rydberg qubits.
We experimentally apply it to the maximum independent set (MIS) problem with up to 100 qubits and show an enhancement in the approximation ratio with a short evolution time.
- Score: 37.47457207667808
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We propose analog counterdiabatic quantum computing (ACQC) to tackle combinatorial optimization problems on neutral-atom quantum processors. While these devices allow for the use of hundreds of qubits, adiabatic quantum computing struggles with non-adiabatic errors, which are inevitable due to the hardware's restricted coherence time. We design counterdiabatic protocols to circumvent those limitations via ACQC on analog quantum devices with ground-Rydberg qubits. To demonstrate the effectiveness of our paradigm, we experimentally apply it to the maximum independent set (MIS) problem with up to 100 qubits and show an enhancement in the approximation ratio with a short evolution time. We believe ACQC establishes a path toward quantum advantage for a variety of industry use cases.
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) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - 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) - Early Fault-Tolerant Quantum Computing [0.0]
We develop a model for the performance of early fault-tolerant quantum computing (EFTQC) architectures.
We show that, for the canonical task of phase estimation, in a regime of moderate scalability and using just over one million physical qubits, the reach'' of the quantum computer can be extended.
arXiv Detail & Related papers (2023-11-24T19:12:47Z) - Rapid cryogenic characterisation of 1024 integrated silicon quantum dots [0.6819010383838326]
We demonstrate the integration of 1024 silicon quantum dots with on-chip digital and analogue electronics, all operating below 1 K.
Key quantum dot parameters are extracted by fast automated machine learning routines to assess quantum dot yield and understand the impact of device design.
Results show how rapid large-scale studies of silicon quantum devices can be performed at lower temperatures and measurement rates orders of magnitude faster than current probing techniques.
arXiv Detail & Related papers (2023-10-31T13:14:43Z) - 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) - Demonstration of a quantum SWITCH in a Sagnac configuration [0.0]
The quantum SWITCH is an example of a process with an indefinite causal structure.
We demonstrate an intrinsically stable quantum SWITCH utilizing a common-path geometry facilitated by a novel reciprocal and universal $mathrmSU(2)$ polarization gadget.
arXiv Detail & Related papers (2022-11-22T19:15:18Z) - Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing [3.106630515217536]
counter-diabatic (CD) driving provides a promising means to speed up quantum many-body systems.
We show the applicability of CD driving to enhance the digitized adiabatic quantum computing paradigm in terms of fidelity and total simulation time.
We implement this proposal in the IBM quantum computer, proving its usefulness for the speed up of adiabatic quantum computing in noisy intermediate-scale quantum devices.
arXiv Detail & Related papers (2020-09-08T06:28:32Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.