Sampling random quantum circuits: a pedestrian's guide

• URL: http://arxiv.org/abs/2007.07872v1
• Date: Fri, 10 Jul 2020 19:26:08 GMT
• Title: Sampling random quantum circuits: a pedestrian's guide
• Authors: Sean Mullane
• Abstract summary: Recent experiments completed by collaborating research groups from Google, NASA Ames, UC Santa Barbara, and others provided compelling evidence that quantum supremacy has been achieved on a superconducting quantum processor. Unfortunately, understanding how this theoretical basis can be used to define quantum supremacy is an extremely difficult task. This article is an attempt to alleviate this difficulty in those who wish to understand the theoretical basis of Google's quantum supremacy experiments, by carefully walking through a derivation of their precise mathematical definition of quantum supremacy.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent experiments completed by collaborating research groups from Google, NASA Ames, UC Santa Barbara, and others provided compelling evidence that quantum supremacy has finally been achieved on a superconducting quantum processor. The theoretical basis for these experiments depends on sampling the output distributions of random quantum circuits; unfortunately, understanding how this theoretical basis can be used to define quantum supremacy is an extremely difficult task. Anyone attempting to understand how this sampling task relates to quantum supremacy must study concepts from random matrix theory, mathematical analysis, quantum chaos, computational complexity, and probability theory. Resources connecting these concepts in the context of quantum supremacy are scattered and often difficult to find. This article is an attempt to alleviate this difficulty in those who wish to understand the theoretical basis of Google's quantum supremacy experiments, by carefully walking through a derivation of their precise mathematical definition of quantum supremacy. It's designed for advanced undergraduate or graduate students who want more information than can be provided in popular science articles, but who might not know where to begin when tackling the many research papers related to quantum supremacy.

Related papers

• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Quantum computing: principles and applications [3.717431207294639]
  We introduce the basic principles of quantum computing and the multilayer architecture for a quantum computer. Based on a mature experimental platform, the Nuclear Magnetic Resonance (NMR) platform, we introduce the basic steps to experimentally implement quantum computing.
  arXiv  Detail & Related papers  (2023-10-13T20:12:28Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum information and beyond -- with quantum candies [0.0]
  We investigate, extend, and greatly expand here "quantum candies" (invented by Jacobs) "quantum" candies describe some basic concepts in quantum information, including quantum bits, complementarity, the no-cloning principle, and entanglement. These demonstrations are done in an approachable manner, that can be explained to high-school students, without using the hard-to-grasp concept of superpositions and its mathematics.
  arXiv  Detail & Related papers  (2021-09-30T16:05:33Z)
• Depth-efficient proofs of quantumness [77.34726150561087]
  A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover. In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
  arXiv  Detail & Related papers  (2021-07-05T17:45:41Z)
• Test of Quantumness with Small-Depth Quantum Circuits [1.90365714903665]
  Recently, we have shown how to construct a test of quantumness based on the learning with errors (LWE) assumption. This test has lead to several cryptographic applications. In this paper, we show that this test of quantumness, and essentially all the above applications, can actually be implemented by a very weak class of quantum circuits.
  arXiv  Detail & Related papers  (2021-05-12T08:16:20Z)
• Towards understanding the power of quantum kernels in the NISQ era [79.8341515283403]
  We show that the advantage of quantum kernels is vanished for large size datasets, few number of measurements, and large system noise. Our work provides theoretical guidance of exploring advanced quantum kernels to attain quantum advantages on NISQ devices.
  arXiv  Detail & Related papers  (2021-03-31T02:41:36Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum supremacy in driven quantum many-body systems [0.0]
  We show that quantum supremacy can be obtained in generic periodically-driven quantum many-body systems. Our proposal opens the way for a large class of quantum platforms to demonstrate and benchmark quantum supremacy.
  arXiv  Detail & Related papers  (2020-02-27T07:20:15Z)
• Quantum Simulation of Quantum Field Theory in the Light-Front Formulation [0.0]
  Quantum chromodynamics (QCD) describes the structure of hadrons such as the proton at a fundamental level. Uncertainty in the parton distribution function is the dominant source of error in the $W$ mass measurement at the LHC. We show how this can be achieved by using the light-front formulation of quantum field theory.
  arXiv  Detail & Related papers  (2020-02-10T18:43:07Z)

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.