Feedback-based Quantum Algorithm Inspired by Counterdiabatic Driving
- URL: http://arxiv.org/abs/2401.15303v1
- Date: Sat, 27 Jan 2024 05:41:32 GMT
- Title: Feedback-based Quantum Algorithm Inspired by Counterdiabatic Driving
- Authors: Rajesh K. Malla, Hiroki Sukeno, Hongye Yu, Tzu-Chieh Wei, Andreas
Weichselbaum, and Robert M. Konik
- Abstract summary: We propose a substantial enhancement by integrating quantum Lyapunov control with the counterdiabatic driving protocol.
We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains.
This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation.
- Score: 0.32985979395737786
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In recent quantum algorithmic developments, a feedback-based approach has
shown promise for preparing quantum many-body system ground states and solving
combinatorial optimization problems. This method utilizes quantum Lyapunov
control to iteratively construct quantum circuits. Here, we propose a
substantial enhancement by integrating quantum Lyapunov control with the
counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our
approach introduces an additional control field inspired by counterdiabatic
driving. We apply our algorithm to prepare ground states in one-dimensional
quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable
acceleration in population transfer to low-energy states within a significantly
reduced time frame compared to conventional feedback-based quantum algorithms.
This acceleration translates to a reduced quantum circuit depth, a critical
metric for potential quantum computer implementation. We validate our algorithm
on the IBM cloud computer, highlighting its efficacy in expediting quantum
computations for many-body systems and combinatorial optimization problems.
Related papers
- Quantum quench dynamics as a shortcut to adiabaticity [31.114245664719455]
We develop and test a quantum algorithm in which the incorporation of a quench step serves as a remedy to the diverging adiabatic timescale.
Our experiments show that this approach significantly outperforms the adiabatic algorithm.
arXiv Detail & Related papers (2024-05-31T17:07:43Z) - Quantum improvement in Spatial Discretization [0.0]
We introduce a quantum algorithm that improves spatial discretization within constraints.
Our algorithm bridges the gap from theoretical models to tangible quantum circuitry.
arXiv Detail & Related papers (2023-12-14T15:36:10Z) - 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) - Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem.
The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z) - Time-Optimal Quantum Driving by Variational Circuit Learning [2.9582851733261286]
Digital quantum simulation and hybrid circuit learning opens up new prospects for quantum optimal control.
We simulate the wave-packet expansion of a trapped quantum particle on a quantum device with a finite number qubits.
We discuss the robustness of our method against errors and demonstrate the absence of barren plateaus in the circuit.
arXiv Detail & Related papers (2022-11-01T11:53:49Z) - Surviving The Barren Plateau in Variational Quantum Circuits with
Bayesian Learning Initialization [0.0]
Variational quantum-classical hybrid algorithms are seen as a promising strategy for solving practical problems on quantum computers in the near term.
Here, we introduce the fast-and-slow algorithm, which uses gradients to identify a promising region in Bayesian space.
Our results move variational quantum algorithms closer to their envisioned applications in quantum chemistry, optimization, and quantum simulation problems.
arXiv Detail & Related papers (2022-03-04T17:48:57Z) - Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state.
In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
arXiv Detail & Related papers (2021-12-27T21:15:35Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems.
We propose an algorithm to implement imaginary time propagation on a quantum computer.
arXiv Detail & Related papers (2021-02-24T12:48:00Z) - Direct Quantum Communications in the Presence of Realistic Noisy
Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement.
Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z) - 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)
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.