Imagen de Portada

Quantum Threshold is Powerful

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Grier, Daniel, Morris, Jackson
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

$\mathsf{QAC}^0$ Contains $\mathsf{TC}^0$ (with Many Copies of the Input)
por: Grier, Daniel, et al.
Publicado: (2026)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
por: Grier, Daniel, et al.
Publicado: (2025)

Fast simulation of planar Clifford circuits
por: Gosset, David, et al.
Publicado: (2020)

Sampling Frequency Thresholds for Quantum Advantage of Quantum Approximate Optimization Algorithm
por: Lykov, Danylo, et al.
Publicado: (2022)

Complexity-theoretic foundations of BosonSampling with a linear number of modes
por: Bouland, Adam, et al.
Publicado: (2023)

The Power of Lorentz Quantum Computer
por: Zhang, Qi, et al.
Publicado: (2024)

The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
por: Jeronimo, Fernando Granha, et al.
Publicado: (2024)

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
por: Grilo, Alex Bredariol, et al.
Publicado: (2024)

Exponential Separation Criteria for Quantum Iterative Power Algorithms
por: Czégel, András, et al.
Publicado: (2025)

Extensively Not P-Bi-Immune promiseBQP-Complete Languages
por: Jackson, Andrew
Publicado: (2024)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
por: Barch, Brian, et al.
Publicado: (2025)

The Exact Replica Threshold for Nonlinear Moments of Quantum States
por: Zeng, Shuai
Publicado: (2026)

A Criterion for Post-Selected Quantum Advantage
por: Karamchedu, Chaitanya, et al.
Publicado: (2024)

Bounds on Eventually Universal Quantum Gate Sets
por: Karamchedu, Chaitanya, et al.
Publicado: (2025)

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

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
por: Cardoso, Ricardo Rivera, et al.
Publicado: (2025)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
por: Rudolph, Dorian, et al.
Publicado: (2024)

Elementary Quantum Recursion Schemes That Capture Quantum Polylogarithmic Time Computability of Quantum Functions
por: Yamakami, Tomoyuki
Publicado: (2023)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
por: Gharibian, Sevag, et al.
Publicado: (2021)

New Quantum Algorithms for Computing Quantum Entropies and Distances
por: Wang, Qisheng, et al.
Publicado: (2022)

Quantum Advantage in Decision Trees: A Weighted Graph and $L_1$ Norm Approach
por: Grillo, Sebastian Alberto, et al.
Publicado: (2026)

Basic Quantum Algorithms
por: Portugal, Renato
Publicado: (2022)

Uncloneable Quantum Advice
por: Broadbent, Anne, et al.
Publicado: (2023)

Quantum Communication Advantage in TFNP
por: Göös, Mika, et al.
Publicado: (2024)

Bosonic Quantum Computational Complexity
por: Chabaud, Ulysse, et al.
Publicado: (2024)

Quantum Search With Generalized Wildcards
por: Cornelissen, Arjan, et al.
Publicado: (2025)

Quantum Interactive Oracle Proofs
por: Sun, Baocheng, et al.
Publicado: (2026)

An Efficient Quantum Factoring Algorithm
por: Regev, Oded
Publicado: (2023)

Efficient Quantum Hermite Transform
por: Jain, Siddhartha, et al.
Publicado: (2025)

On the Complexity of Decoded Quantum Interferometry
por: Marwaha, Kunal, et al.
Publicado: (2025)

On the Need for Large Quantum Depth
por: Chia, Nai-Hui, et al.
Publicado: (2019)

Pseudo-deterministic Quantum Algorithms
por: Aaronson, Hugo, et al.
Publicado: (2026)

Efficient Algorithms for Quantum Hashing
por: Zinnatullin, Ilnar, et al.
Publicado: (2025)

Formal Framework for Quantum Advantage
por: Buhrman, Harry, et al.
Publicado: (2025)

Complexity Theory for Quantum Promise Problems
por: Chia, Nai-Hui, et al.
Publicado: (2024)

A Quantum Unique Games Conjecture
por: Mousavi, Hamoon, et al.
Publicado: (2024)

Quantum state testing with restricted measurements
por: Liu, Yuhan, et al.
Publicado: (2024)

Quantum computational complexity of matrix functions
por: Cifuentes, Santiago, et al.
Publicado: (2024)

Quantum Algorithms in a Superposition of Spacetimes
por: Shmueli, Omri
Publicado: (2024)

The Entangled Quantum Polynomial Hierarchy Collapses
por: Grewal, Sabee, et al.
Publicado: (2024)