Cover Image

Classically estimating observables of noiseless quantum circuits

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Angrisani, Armando, Schmidhuber, Alexander, Rudolph, Manuel S., Cerezo, M., Holmes, Zoë, Huang, Hsin-Yuan
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity Mathematical Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

When quantum resources backfire: Non-gaussianity and symplectic coherence in noisy bosonic circuits
by: Upreti, Varun, et al.
Published: (2025)

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
by: Martinez, Victor, et al.
Published: (2025)

Coherent-State Propagation: A Computational Framework for Simulating Bosonic Quantum Systems
by: Guseynov, Nikita, et al.
Published: (2026)

Learning unitaries with quantum statistical queries
by: Angrisani, Armando
Published: (2023)

Simulating quantum circuits with arbitrary local noise using Pauli Propagation
by: Angrisani, Armando, et al.
Published: (2025)

Complexity of quantum circuits via sensitivity, magic, and coherence
by: Bu, Kaifeng, et al.
Published: (2022)

How to Construct Random Unitaries
by: Ma, Fermi, et al.
Published: (2024)

Unitary designs in nearly optimal depth
by: Cui, Laura, et al.
Published: (2025)

Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
by: Barthe, Alice, et al.
Published: (2024)

A polynomial-time classical algorithm for noisy quantum circuits
by: Schuster, Thomas, et al.
Published: (2024)

Quantum Kolmogorov complexity and quantum correlations in deterministic-control quantum Turing machines
by: Lemus, Mariano, et al.
Published: (2023)

Convergence efficiency of quantum gates and circuits
by: Kong, Linghang, et al.
Published: (2024)

Classical simulability of quantum circuits followed by sparse classical post-processing
by: Takahashi, Yasuhiro, et al.
Published: (2026)

Approximating the quantum value of an LCS game is RE-hard
by: Taller, Aviv, et al.
Published: (2025)

Exact spectral gaps of random one-dimensional quantum circuits
by: Deneris, Andrew E., et al.
Published: (2024)

Random unitaries that conserve energy
by: Mao, Liang, et al.
Published: (2025)

Hardness of recognizing phases of matter
by: Schuster, Thomas, et al.
Published: (2025)

Quon Classical Simulation: Unifying Cliffords, Matchgates and Entanglement
by: Feng, Zixuan, et al.
Published: (2025)

Quartic quantum speedups for planted inference
by: Schmidhuber, Alexander, et al.
Published: (2024)

Random unitaries from Hamiltonian dynamics
by: Cui, Laura, et al.
Published: (2025)

On estimating the entropy of shallow circuit outputs
by: Gheorghiu, Alexandru, et al.
Published: (2020)

The power of quantum circuits in sampling
by: Blanc, Guy, et al.
Published: (2025)

On the Computational Complexity of Schrödinger Operators
by: Zheng, Yufan, et al.
Published: (2024)

Fermionic Gaussian Testing and Non-Gaussian Measures via Convolution
by: Lyu, Xingjian, et al.
Published: (2024)

Proof of Hiding Conjecture in Gaussian Boson Sampling
by: Shou, Laura, et al.
Published: (2025)

Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
by: Bu, Kaifeng, et al.
Published: (2023)

Optimising quantum circuits is generally hard
by: van de Wetering, John, et al.
Published: (2023)

Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
by: Takahashi, Jun, et al.
Published: (2024)

Bell sampling from quantum circuits
by: Hangleiter, Dominik, et al.
Published: (2023)

Classical versus quantum queries in quantum PCPs with classical proofs
by: Buhrman, Harry, et al.
Published: (2024)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
by: Iyer, Vishnu, et al.
Published: (2026)

Efficient quantum-enhanced classical simulation for patches of quantum landscapes
by: Lerch, Sacha, et al.
Published: (2024)

Learning junta distributions, quantum junta states, and QAC$^0$ circuits
by: Bao, Jinge, et al.
Published: (2024)

The vast world of quantum advantage
by: Huang, Hsin-Yuan, et al.
Published: (2025)

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
by: Aldi, Marco, et al.
Published: (2024)

Tight bounds on depth-2 QAC-circuits computing parity
by: Fenner, Stephen, et al.
Published: (2025)

Rational degree is polynomially related to degree
by: Kothari, Robin, et al.
Published: (2026)

A learning theory for quantum photonic processors and beyond
by: Rosati, Matteo
Published: (2022)

On the average-case complexity of learning output distributions of quantum circuits
by: Nietner, Alexander, et al.
Published: (2023)

An alternative explicit circuit diagram for the quantum search algorithm by implementing a non-unitary gate
by: Daskin, Ammar
Published: (2024)