Exploiting dynamic quantum circuits in a quantum algorithm with
superconducting qubits
- URL: http://arxiv.org/abs/2102.01682v1
- Date: Tue, 2 Feb 2021 18:51:23 GMT
- Title: Exploiting dynamic quantum circuits in a quantum algorithm with
superconducting qubits
- Authors: Antonio D. Corcoles, Maika Takita, Ken Inoue, Scott Lekuch, Zlatko K.
Minev, Jerry M. Chow, Jay M. Gambetta
- Abstract summary: We build dynamic quantum circuits on a superconducting-based quantum system.
We exploit one of the most fundamental quantum algorithms, quantum phase estimation, in its adaptive version.
We demonstrate that the version of real-time quantum computing with dynamic circuits can offer a substantial and tangible advantage.
- Score: 0.207811670193148
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The execution of quantum circuits on real systems has largely been limited to
those which are simply time-ordered sequences of unitary operations followed by
a projective measurement. As hardware platforms for quantum computing continue
to mature in size and capability, it is imperative to enable quantum circuits
beyond their conventional construction. Here we break into the realm of dynamic
quantum circuits on a superconducting-based quantum system. Dynamic quantum
circuits involve not only the evolution of the quantum state throughout the
computation, but also periodic measurements of a subset of qubits mid-circuit
and concurrent processing of the resulting classical information within
timescales shorter than the execution times of the circuits. Using noisy
quantum hardware, we explore one of the most fundamental quantum algorithms,
quantum phase estimation, in its adaptive version, which exploits dynamic
circuits, and compare the results to a non-adaptive implementation of the same
algorithm. We demonstrate that the version of real-time quantum computing with
dynamic circuits can offer a substantial and tangible advantage when noise and
latency are sufficiently low in the system, opening the door to a new realm of
available algorithms on real quantum systems.
Related papers
- Robust Implementation of Discrete-time Quantum Walks in Any Finite-dimensional Quantum System [2.646968944595457]
discrete-time quantum walk (DTQW) model one of most suitable choices for circuit implementation.
In this paper, we have successfully cut down the circuit cost concerning gate count and circuit depth by half.
For the engineering excellence of our proposed approach, we implement DTQW in any finite-dimensional quantum system with akin efficiency.
arXiv Detail & Related papers (2024-08-01T13:07:13Z) - 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) - Dynamic quantum circuit compilation [11.550577505893367]
Recent advancements in quantum hardware have introduced mid-circuit measurements and resets, enabling the reuse of measured qubits.
We present a systematic study of dynamic quantum circuit compilation, a process that transforms static quantum circuits into their dynamic equivalents.
arXiv Detail & Related papers (2023-10-17T06:26:30Z) - Combining Matrix Product States and Noisy Quantum Computers for Quantum
Simulation [0.0]
Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems.
We show that using classical knowledge in the form of tensor networks provides a way to better use limited quantum resources.
arXiv Detail & Related papers (2023-05-30T17:21:52Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - 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) - Equivalence Checking of Dynamic Quantum Circuits [7.835264621634824]
State-of-the-art quantum devices still contain only a very limited number of qubits.
One possible way to execute more realistic algorithms in near-term quantum devices is to employ dynamic quantum circuits.
This technique can help to significantly reduce the resources required to achieve a given accuracy of a quantum algorithm.
arXiv Detail & Related papers (2021-06-03T08:03:22Z) - 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) - 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)
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.