• Corpus ID: 252519351

Navigating the noise-depth tradeoff in adiabatic quantum circuits

  title={Navigating the noise-depth tradeoff in adiabatic quantum circuits},
  author={Daniel Azses and Maxime Dupont and Bram Evert and Matthew Reagor and Emanuele G. Dalla Torre},
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves monotonically with increasing circuit depth. By contrast, increasing the depth in current noisy computers introduces more noise and eventually deteriorates any computational advantage. What is the optimal circuit depth that provides the best solution? Here, we address this question by investigating an adiabatic circuit… 

Figures from this paper



Characterizing quantum supremacy in near-term devices

A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of…

Fixed Depth Hamiltonian Simulation via Cartan Decomposition.

A constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth, for special classes of models, including Anderson localization in one-dimensional transverse field XY model.

Quantum phases of matter on a 256-atom programmable quantum simulator.

This work demonstrates a programmable quantum simulator based on deterministically prepared two-dimensional arrays of neutral atoms, featuring strong interactions controlled by coherent atomic excitation into Rydberg states, and realizes a quantum spin model with tunable interactions for system sizes ranging from 64 to 256 qubits.

Quantum Supremacy through the Quantum Approximate Optimization Algorithm

It is argued that beyond its possible computational value the QAOA can exhibit a form of Quantum Supremacy in that, based on reasonable complexity theoretic assumptions, the output distribution of even the lowest depth version cannot be efficiently simulated on any classical device.

Coherent quantum annealing in a programmable 2,000 qubit Ising chain

Quantum simulation has emerged as a valuable arena for demonstrating and understanding the capabilities of near-term quantum computers1–3. Quantum annealing4,5 has been successfully used in…

Quantum computational advantage using photons

Gaussian boson sampling was performed by sending 50 indistinguishable single-mode squeezed states into a 100-mode ultralow-loss interferometer with full connectivity and random matrix and sampling the output using 100 high-efficiency single-photon detectors, and the obtained samples were validated against plausible hypotheses exploiting thermal states, distinguishable photons, and uniform distribution.

Probing the universality of topological defect formation in a quantum annealer: Kibble-Zurek mechanism and beyond

The number of topological defects created in a system driven through a quantum phase transition exhibits a power-law scaling with the driving time. This universal scaling law is the key prediction of…

Realizing discrete time crystal in an one-dimensional superconducting qubit chain

Floquet engineering, i.e. driving the system with periodic Hamiltonians, not only provides great flexibility in analog quantum simulation, but also supports phase structures of great richness. It has…

Efficient Estimation of Pauli Channels

These results enable a host of applications beyond just characterizing noise in a large-scale quantum system: they pave the way to tailoring quantum codes, optimizing decoders, and customizing fault tolerance procedures to suit a particular device.

Characterizing large-scale quantum computers via cycle benchmarking

Quantum computers promise to solve certain problems more efficiently than their digital counterparts. A major challenge towards practically useful quantum computing is characterizing and reducing the…