• Corpus ID: 238634707

Learnability of the output distributions of local quantum circuits

  title={Learnability of the output distributions of local quantum circuits},
  author={Marcel Hinsche and Marios Ioannou and A. Nietner and Jonas Haferkamp and Yihui Quek and Dominik Hangleiter and Jean-Pierre Seifert and Jens Eisert and Ryan Sweke},
M. Hinsche, M. Ioannou, A. Nietner, J. Haferkamp, 2 Y. Quek, 1 D. Hangleiter, 1 J.-P. Seifert, 6 J. Eisert, 2, 7 and R. Sweke Dahlem Center for Complex Quantum Systems, Freie Universität Berlin, 14195 Berlin, Germany Helmholtz-Zentrum Berlin für Materialien und Energie, 14109 Berlin, Germany Information Systems Laboratory, Stanford University, Stanford, CA 94305, USA Joint Center for Quantum Information and Computer Science (QuICS), University of Maryland and NIST, College Park, MD 20742, USA… 

Figures from this paper

Learning Classical Readout Quantum PUFs based on single-qubit gates
This work formalizes the class of Classical Readout Quantum PUFs (CR-QPUFs) using the statistical query (SQ) model and explicitly shows insufficient security for CR-Q PUFs based on single qubit rotation gates, when the adversary has SQ access to the CR-ZPUF.
Evaluating Generalization in Classical and Quantum Generative Models
Defining and accurately measuring generalization in generative models remains an ongoing challenge and a topic of active research within the machine learning community. This is in contrast to
Equivariant Quantum Graph Circuits
We investigate quantum circuits for graph representation learning, and propose equivariant quantum graph circuits (EQGCs), as a class of parameterized quantum circuits with strong relational


Stabiliser states are efficiently PAC-learnable
The results solve an open problem formulated by Aaronson (2007) and establish a connection between classical simulation of quantum systems and efficient learnability.
Local Random Quantum Circuits are Approximate Polynomial-Designs
We prove that local random quantum circuits acting on n qubits composed of O(t10n2) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether
On the complexity and verification of quantum random circuit sampling
A critical milestone on the path to useful quantum computers is the demonstration of a quantum computation that is prohibitively hard for classical computers—a task referred to as quantum supremacy.
The learnability of quantum states
  • S. Aaronson
  • Computer Science, Physics
    Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2007
This theorem has the conceptual implication that quantum states, despite being exponentially long vectors, are nevertheless ‘reasonable’ in a learning theory sense and has two applications to quantum computing: first, a new simulation of quantum one-way communication protocols and second, the use of trusted classical advice to verify untrusted quantum advice.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
We consider quantum computations comprising only commuting gates, known as IQP computations, and provide compelling evidence that the task of sampling their output probability distributions is
Sample Complexity of Device-Independently Certified "Quantum Supremacy".
It is shown that any noninteractive certification from classical samples and a description of the target distribution requires exponentially many uses of the device, and that the sampling distributions, as random variables depending on the random unitaries defining the problem instances, have small second moments.
A quantum machine learning algorithm based on generative models
A general quantum algorithm for machine learning based on a quantum generative model that is more capable of representing probability distributions compared with classical generative models and has exponential speedup in learning and inference at least for some instances if a quantum computer cannot be efficiently simulated classically.
The Clifford group forms a unitary 3-design
  • Z. Webb
  • Physics, Mathematics
    Quantum Inf. Comput.
  • 2016
It is proved that the Clifford group is a 3-design, showing that it is a better approximation to Haar-random unitaries than previously expected and characterizing how well random Clifford elements approximateHaar- random unitaries.
Quantum generative adversarial learning in a superconducting quantum circuit
It is demonstrated that, after several rounds of adversarial learning, a quantum-state generator can be trained to replicate the statistics of the quantum data output from a quantum channel simulator, with a high fidelity so that the discriminator cannot distinguish between the true and the generated data.
A General Characterization of the Statistical Query Complexity
This work demonstrates that the complexity of solving general problems over distributions using SQ algorithms can be captured by a relatively simple notion of statistical dimension that is introduced, and is also the first to precisely characterize the necessary tolerance of queries.