Imagen de Portada

A polynomial-time classical algorithm for noisy quantum circuits

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Schuster, Thomas, Yin, Chao, Gao, Xun, Yao, Norman Y.
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Computational Complexity Information Theory Mathematical Physics Atomic Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Hardness of recognizing phases of matter
por: Schuster, Thomas, et al.
Publicado: (2025)

Fault-tolerant compiling of classically hard IQP circuits on hypercubes
por: Hangleiter, Dominik, et al.
Publicado: (2024)

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

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

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

Poincaré Duality and Multiplicative Structures on Quantum Codes
por: Li, Yiming, et al.
Publicado: (2025)

Optimal, Qubit-Efficient Quantum Vehicle Routing via Colored-Permutations
por: Onah, Chinonso, et al.
Publicado: (2026)

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

Classically estimating observables of noiseless quantum circuits
por: Angrisani, Armando, et al.
Publicado: (2024)

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

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

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
por: Dinur, Irit, et al.
Publicado: (2024)

Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
por: Panova, Greta
Publicado: (2025)

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

Hamiltonian Learning at Heisenberg Limit for Hybrid Quantum Systems
por: Zhang, Lixing, et al.
Publicado: (2025)

Integer Programming Using A Single Atom
por: Goswami, Kapil, et al.
Publicado: (2024)

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

On the undecidability of quantum channel capacities
por: Bhattacharyya, Archishna, et al.
Publicado: (2026)

A slightly improved upper bound for quantum statistical zero-knowledge
por: Gall, François Le, et al.
Publicado: (2025)

Adversarially robust quantum state learning and testing
por: Aliakbarpour, Maryam, et al.
Publicado: (2025)

Unconditionally separating noisy $\mathsf{QNC}^0$ from bounded polynomial threshold circuits of constant depth
por: Hsieh, Min-Hsiu, et al.
Publicado: (2024)

Exponential speedups in fault-tolerant processing of quantum experiments
por: Kannan, Ishaan, et al.
Publicado: (2026)

The role of shared randomness in quantum state certification with unentangled measurements
por: Liu, Yuhan, et al.
Publicado: (2024)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
por: Lin, Ting-Chun
Publicado: (2024)

Non-Heisenbergian quantum mechanics
por: Kazemi, MohammadJavad, et al.
Publicado: (2024)

Quantum state testing beyond the polarizing regime and quantum triangular discrimination
por: Liu, Yupan
Publicado: (2023)

Computational hardness of estimating quantum entropies via binary entropy bounds
por: Liu, Yupan
Publicado: (2026)

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

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

Fast surrogate modelling of EIT in atomic quantum systems using LSTM neural networks
por: Hita, Isabel S. Burdon, et al.
Publicado: (2025)

On Estimating the Quantum Tsallis Relative Entropy
por: Bao, Jinge, et al.
Publicado: (2025)

Random unitaries in extremely low depth
por: Schuster, Thomas, et al.
Publicado: (2024)

Exponential quantum advantage in processing massive classical data
por: Zhao, Haimeng, et al.
Publicado: (2026)

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
por: Anand, Kartik, et al.
Publicado: (2025)

Accessible Quantum Correlations Under Complexity Constraints
por: Yángüez, Álvaro, et al.
Publicado: (2026)

Overcoming limitations on gate fidelity in noisy static exchange-coupled surface qubits
por: Le, Hoang-Anh, et al.
Publicado: (2025)

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

Solving optimization problems with local light shift encoding on Rydberg quantum annealers
por: Goswami, Kapil, et al.
Publicado: (2023)

Universal classical-quantum channel resolvability and private channel coding
por: Matsuura, Takaya, et al.
Publicado: (2025)

Partial majorization and Schur concave functions on the sets of quantum and classical states
por: Shirokov, M. E.
Publicado: (2026)