Experimental demonstration of the advantage of adaptive quantum circuits
- URL: http://arxiv.org/abs/2302.03029v1
- Date: Mon, 6 Feb 2023 18:59:58 GMT
- Title: Experimental demonstration of the advantage of adaptive quantum circuits
- Authors: Michael Foss-Feig, Arkin Tikku, Tsung-Cheng Lu, Karl Mayer, Mohsin
Iqbal, Thomas M. Gatterman, Justin A. Gerber, Kevin Gilmore, Dan Gresh, Aaron
Hankin, Nathan Hewitt, Chandler V. Horst, Mitchell Matheny, Tanner Mengle,
Brian Neyenhuis, Henrik Dreyer, David Hayes, Timothy H. Hsieh, and Isaac H.
Kim
- Abstract summary: We experimentally demonstrate that even a noisy adaptive quantum circuit of constant depth can achieve a task that is impossible for any purely unitary quantum circuit of identical depth.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Adaptive quantum circuits employ unitary gates assisted by mid-circuit
measurement, classical computation on the measurement outcome, and the
conditional application of future unitary gates based on the result of the
classical computation. In this paper, we experimentally demonstrate that even a
noisy adaptive quantum circuit of constant depth can achieve a task that is
impossible for any purely unitary quantum circuit of identical depth: the
preparation of long-range entangled topological states with high fidelity. We
prepare a particular toric code ground state with fidelity of at least $76.9\pm
1.3\%$ using a constant depth ($d=4$) adaptive circuit, and rigorously show
that no unitary circuit of the same depth and connectivity could prepare this
state with fidelity greater than $50\%$.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - 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) - Mapping quantum circuits to shallow-depth measurement patterns based on
graph states [0.0]
We create a hybrid simulation technique for measurement-based quantum computing.
We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements.
We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
arXiv Detail & Related papers (2023-11-27T19:00:00Z) - Efficient Quantum Circuits based on the Quantum Natural Gradient [0.0]
Efficient preparation of arbitrary entangled quantum states is crucial for quantum computation.
We propose symmetry-conserving modified quantum approximate optimization algorithm(SCom-QAOA) circuits.
The proposed scheme enlarges the set of the initial states accessible for variational quantum algorithms and widens the scope of investigation of non-equilibrium phenomena in quantum simulators.
arXiv Detail & Related papers (2023-10-16T16:08:57Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Gaussian initializations help deep variational quantum circuits escape
from the barren plateau [87.04438831673063]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - Quantum computational advantage attested by nonlocal games with the
cyclic cluster state [0.0]
We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner.
Our games offer a practical and scalable set of quantitative benchmarks for quantum computers in the pre-fault-tolerant regime as the number of qubits available increases.
arXiv Detail & Related papers (2021-10-08T17:43:38Z) - Configurable sublinear circuits for quantum state preparation [1.9279780052245203]
We show a configuration that encodes an $N$-dimensional state by a quantum circuit with $O(sqrtN)$ width and depth and entangled information in ancillary qubits.
We show a proof-of-principle on five quantum computers and compare the results.
arXiv Detail & Related papers (2021-08-23T13:52:43Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - 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.