Efficient simulation of so-called non-stoquastic superconducting flux circuits

• URL: http://arxiv.org/abs/2011.03831v1
• Date: Sat, 7 Nov 2020 18:59:46 GMT
• Title: Efficient simulation of so-called non-stoquastic superconducting flux circuits
• Authors: Tom Halverson, Lalit Gupta, Moshe Goldstein, and Itay Hen
• Abstract summary: We show that the efficient simulation of superconducting flux circuits is possible by the direct simulation of the flux circuits. We argue that our results cast doubt on the conception that superconducting flux circuits represent the correct avenue for universal adiabatic quantum computers.
• Score: 0.27998963147546146
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: There is a tremendous interest in fabricating superconducting flux circuits that are nonstoquastic---i.e., have positive off-diagonal matrix elements---in their qubit representation, as these circuits are thought to be unsimulable by classical approaches and thus could play a key role in the demonstration of speedups in quantum annealing protocols. We show however that the efficient simulation of these systems is possible by the direct simulation of the flux circuits. Our approach not only obviates the reduction to a qubit representation but also produces results that are more in the spirit of the experimental setup. We discuss the implications of our work. Specifically we argue that our results cast doubt on the conception that superconducting flux circuits represent the correct avenue for universal adiabatic quantum computers.

Related papers

• Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations [0.6428333375712125]
  We develop an approach for minimizing the total negativity of a given quantum circuit with respect to quasiprobability representations, that are overcomplete. Our approach includes both optimization over equivalent quasistochastic vectors and matrices, which appear due to the overcompleteness. We also study the negativity minimization of noisy brick-wall random circuits via a combination of increasing frame dimension and applying gate merging technique.
  arXiv  Detail & Related papers  (2023-06-19T08:02:00Z)
• Abstraqt: Analysis of Quantum Circuits via Abstract Stabilizer Simulation [8.74592908228434]
  We present a novel approach for efficient stabilizer simulation on arbitrary quantum circuits. Our key idea is to compress an exponential sum representation of the quantum state into a single abstract summand. This allows us to introduce an abstract stabilizer simulator that efficiently manipulates abstract summands.
  arXiv  Detail & Related papers  (2023-04-03T12:23:57Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Optimizing for periodicity: a model-independent approach to flux crosstalk calibration for superconducting circuits [0.2236338337974111]
  Large-scale quantum computers based on flux-tunable superconducting circuits face the problem of flux crosstalk. We propose a new method for calibrating flux crosstalk, which is independent of the underlying circuit model. We demonstrate this method on a small-scale quantum annealing circuit based on superconducting flux qubits.
  arXiv  Detail & Related papers  (2022-11-02T21:54:27Z)
• Single-qubit gate teleportation provides a quantum advantage [0.0]
  Gate-teleportation circuits are arguably among the most basic examples of computations believed to provide a quantum computational advantage. We show that even for single-qubit Clifford-gate-teleportation circuits this simulation problem cannot be solved by constant-depth classical circuits with bounded fan-in gates.
  arXiv  Detail & Related papers  (2022-09-28T15:11:39Z)
• Reminiscence of classical chaos in driven transmons [117.851325578242]
  We show that even off-resonant drives can cause strong modifications to the structure of the transmon spectrum rendering a large part of it chaotic. Results lead to a photon number threshold characterizing the appearance of chaos-induced quantum demolition effects.
  arXiv  Detail & Related papers  (2022-07-19T16:04:46Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Operating a passive on-chip superconducting circulator: device control and quasiparticle effects [0.0]
  Microwave circulators play an important role in quantum technology based on superconducting circuits. One promising design for an on-chip superconducting circulator is based on a passive Josephson-junction ring. We consider two operational issues for such a device: circuit tuning and the effects of quasiparticle tunneling.
  arXiv  Detail & Related papers  (2021-03-03T23:46:32Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)
• Hardware-Encoding Grid States in a Non-Reciprocal Superconducting Circuit [62.997667081978825]
  We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code. We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
  arXiv  Detail & Related papers  (2020-02-18T16:45:09Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.