☆ 4.8 Article

One T Gate Makes Distribution Learning Hard

PHYSICAL REVIEW LETTERS (2023)

Related references

Note: Only part of the references are listed.

Article Computer Science, Information Systems

Learning Quantum Circuits of Some T Gates

Ching-Yi Lai et al.

Summary: This paper studies the problem of learning unknown quantum circuits with a specific structure and proposes an efficient algorithm for a certain case. By utilizing a series of measurement operations, an equivalent representation of the target circuit on the computational basis can be obtained, and an exact description of arbitrary input states can be derived with additional classical computations.

IEEE TRANSACTIONS ON INFORMATION THEORY (2022)

Add to Collection

Review Physics, Multidisciplinary

Noisy intermediate-scale quantum algorithms

Kishor Bharti et al.

Summary: NISQ computers, composed of noisy qubits, are already being used in various fields. This review provides a comprehensive summary of NISQ computational paradigms and algorithms and introduces various benchmarking and software tools for programming and testing NISQ devices.

REVIEWS OF MODERN PHYSICS (2022)

Add to Collection

Article Quantum Science & Technology

On the Hardness of PAC-learning Stabilizer States with Noise

Aravind Gollakota et al.

Summary: This paper investigates the problem of learning stabilizer states with noise. Inspired by approaches to noise tolerance from classical learning theory, the Statistical Query (SQ) model is introduced and algorithms in this model are proven to be resilient to common forms of noise. The results position the problem of learning stabilizer states as a difficult task, similar to learning parities, even with simple forms of noise.

QUANTUM (2022)

Add to Collection

Article Physics, Multidisciplinary

Linear growth of quantum circuit complexity

Jonas Haferkamp et al.

Summary: The complexity of quantum states, which is key in quantum computing and black hole theory, has been shown to grow linearly over time under random operations. This study investigates how the complexity of random quantum circuits increases by constructing unitary operations from random two-qubit quantum gates. It is proven that the complexity grows linearly until it saturates at a threshold that is exponentially related to the number of qubits.

NATURE PHYSICS (2022)

Add to Collection

Article Multidisciplinary Sciences

Quantum variational algorithms are swamped with traps

Eric R. Anschuetz et al.

Summary: One of the most important properties of classical neural networks is their surprising trainability, while variational quantum models are often not trainable. Previous research focused on barren plateaus as a major obstacle, but this study shows that it's just part of the story. We prove that a wide class of shallow variational quantum models without barren plateaus have a superpolynomially small fraction of local minima within any constant energy from the global minimum, making them untrainable without a good initial guess of the optimal parameters. Additionally, we demonstrate that noisy optimization of various quantum models is impossible with a sub-exponential number of queries. Numerical results support our findings on different problem instances.

NATURE COMMUNICATIONS (2022)

Add to Collection

Article Physics, Multidisciplinary

Limitations of optimization algorithms on noisy quantum devices

Daniel Stilck Franca et al.

Summary: The study compares classical and quantum algorithms running on noisy devices, finding that current quantum computers are unlikely to outperform classical devices in practical optimization tasks unless noise rates decrease substantially. Noise levels on current quantum devices are too high to produce a quantum advantage in optimization tasks.

NATURE PHYSICS (2021)

Add to Collection

Article Multidisciplinary Sciences

Information scrambling in quantum circuits

Xiao Mi et al.

Summary: By measuring the time-dependent evolution and fluctuation of out-of-time-order correlators on a 53-qubit quantum processor, this experiment investigates the dynamics of quantum scrambling. It is shown that operator entanglement in idealized circuits requires exponentially scaled computational resources to simulate, while operator spreading can be captured by an efficient classical model. These results pave the way for studying complex physical observables with near-term quantum processors.

SCIENCE (2021)

Add to Collection

Article Quantum Science & Technology

Improved upper bounds on the stabilizer rank of magic states

Hammam Qassim et al.

Summary: In this work, we improve the runtime of classical algorithms for strong simulation of quantum circuits composed of Clifford and T gates by establishing new upper bounds on stabilizer ranks. Through known techniques, our algorithm approximates output probabilities of circuits with a given error using a poly(n, m)2(alpha m) runtime. Additionally, we provide improved upper bounds on the stabilizer rank of symmetric product states and suggest a method to further enhance the upper bounds through the construction of linear codes.

QUANTUM (2021)

Add to Collection

Article Quantum Science & Technology

On the Quantum versus Classical Learnability of Discrete Distributions

Ryan Sweke et al.

Summary: This study compares the performance of classical and quantum learners for generative modeling within the Probably Approximately Correct (PAC) framework. The results show that quantum learners exhibit a provable advantage over classical learners in efficiently learning certain discrete probability distributions.

QUANTUM (2021)

Add to Collection

Article Multidisciplinary Sciences

Highly accurate protein structure prediction with AlphaFold

John Jumper et al.

Summary: Proteins are essential for life, and accurate prediction of their structures is a crucial research problem. Current experimental methods are time-consuming, highlighting the need for accurate computational approaches to address the gap in structural coverage. Despite recent progress, existing methods fall short of atomic accuracy in protein structure prediction.

NATURE (2021)

Add to Collection

Article Physics, Multidisciplinary

A rigorous and robust quantum speed-up in supervised machine learning

Yunchao Liu et al.

Summary: Research shows that heuristic quantum kernel methods can achieve quantum speed-up with only classical data access, and a classification problem is constructed to demonstrate this.

NATURE PHYSICS (2021)

Add to Collection

Article Quantum Science & Technology

Models of Quantum Complexity Growth

Fernando G. S. L. Brandao et al.

Summary: The concept of quantum complexity has significant implications in various fields, but deriving lower bounds on quantum complexity for specific unitaries or states remains challenging. By studying generic models of complexity growth and connecting complexity growth with unitary k-designs, researchers can draw conclusions about the growth of complexity in quantum systems. Local random quantum circuits are shown to generate unitary transformations with linear complexity growth, supporting previous conjectures and emphasizing the importance of optimal distinguishing measurements in defining quantum complexity.

PRX QUANTUM (2021)

Add to Collection

Article Physics, Particles & Fields

A random unitary circuit model for black hole evaporation

Lorenzo Piroli et al.

JOURNAL OF HIGH ENERGY PHYSICS (2020)

Add to Collection

Article Quantum Science & Technology

The Born supremacy: quantum advantage and training of an Ising Born machine

Brian Coyle et al.

NPJ QUANTUM INFORMATION (2020)

Add to Collection

Article Optics

Phase-space-simulation method for quantum computation with magic states on qubits

Robert Raussendorf et al.

PHYSICAL REVIEW A (2020)

Add to Collection

Article Quantum Science & Technology

A generative modeling approach for benchmarking and training shallow quantum circuits

Marcello Benedetti et al.

NPJ QUANTUM INFORMATION (2019)

Add to Collection

Article Physics, Multidisciplinary

Nearly Optimal Lattice Simulation by Product Formulas

Andrew M. Childs et al.

PHYSICAL REVIEW LETTERS (2019)

Add to Collection

Review Quantum Science & Technology

Parameterized quantum circuits as machine learning models

Marcello Benedetti et al.

QUANTUM SCIENCE AND TECHNOLOGY (2019)

Add to Collection

Review Physics, Multidisciplinary

Machine learning and the physical sciences

Giuseppe Carleo et al.

REVIEWS OF MODERN PHYSICS (2019)

Add to Collection

Article Quantum Science & Technology

Simulation of quantum circuits by low-rank stabilizer decompositions

Sergey Bravyi et al.

QUANTUM (2019)

Add to Collection

Article Physics, Multidisciplinary

Characterizing quantum supremacy in near-term devices

Sergio Boixo et al.

NATURE PHYSICS (2018)

Add to Collection

Article Optics

Differentiable learning of quantum circuit Born machines

Jin-Guo Liu et al.

PHYSICAL REVIEW A (2018)

Add to Collection

Article Materials Science, Multidisciplinary

Localization with random time-periodic quantum circuits

Christoph Suenderhauf et al.

PHYSICAL REVIEW B (2018)

Add to Collection

Article Astronomy & Astrophysics

CALOGAN: Simulating 3D high energy particle showers in multilayer electromagnetic calorimeters with generative adversarial networks

Michela Paganini et al.

PHYSICAL REVIEW D (2018)

Add to Collection

Review Multidisciplinary Sciences

Roads towards fault-tolerant universal quantum computation

Earl T. Campbell et al.

NATURE (2017)

Add to Collection

Review Multidisciplinary Sciences

Quantum machine learning

Jacob Biamonte et al.

NATURE (2017)

Add to Collection

Article Astronomy & Astrophysics

Generative adversarial networks recover features in astrophysical images of galaxies beyond the deconvolution limit

Kevin Schawinski et al.

MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY (2017)

Add to Collection

Article Physics, Multidisciplinary

Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates

Sergey Bravyi et al.

PHYSICAL REVIEW LETTERS (2016)

Add to Collection

Article Physics, Multidisciplinary

Trading Classical and Quantum Computational Resources

Sergey Bravyi et al.

PHYSICAL REVIEW X (2016)

Add to Collection

Article Physics, Multidisciplinary

Estimating Outcome Probabilities of Quantum Circuits Using Quasiprobabilities

Hakop Pashayan et al.

PHYSICAL REVIEW LETTERS (2015)

Add to Collection

Article Telecommunications

The Rank of Random Binary Matrices and Distributed Storage Applications

Paulo J. S. G. Ferreira et al.

IEEE COMMUNICATIONS LETTERS (2013)

Add to Collection

Article Physics, Multidisciplinary

Negative quasi-probability as a resource for quantum computation

Victor Veitch et al.

NEW JOURNAL OF PHYSICS (2012)

Add to Collection

Article Physics, Multidisciplinary

Positive Wigner Functions Render Classical Simulation of Quantum Computation Efficient

A. Mari et al.

PHYSICAL REVIEW LETTERS (2012)

Add to Collection

Article Multidisciplinary Sciences

Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy

Michael J. Bremner et al.

PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES (2011)

Add to Collection

Article Computer Science, Hardware & Architecture

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography

Oded Regev

JOURNAL OF THE ACM (2009)

Add to Collection

Article Multidisciplinary Sciences

The learnability of quantum states

Scott Aaronson

PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES (2007)

Add to Collection

Article Optics

Fast simulation of stabilizer circuits using a graph-state representation

S Anders et al.

PHYSICAL REVIEW A (2006)

Add to Collection

Article Optics

Improved simulation of stabilizer circuits

S Aaronson et al.

PHYSICAL REVIEW A (2004)

Add to Collection

Article Optics

Clifford group, stabilizer states, and linear and quadratic operations over GF(2)

J Dehaene et al.

PHYSICAL REVIEW A (2003)

Add to Collection

Article Computer Science, Hardware & Architecture

Noise-tolerant learning, the parity problem, and the statistical query model

A Blum et al.

JOURNAL OF THE ACM (2003)

Add to Collection

Article Physics, Mathematical

Efficient discrete approximations of quantum gates

AW Harrow et al.

JOURNAL OF MATHEMATICAL PHYSICS (2002)

Add to Collection

© Peeref 2019-2024. All rights reserved.