Image de couverture de livre

Hardness results for decoding the surface code with Pauli noise

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Fischer, Alex, Miyake, Akimasa
Format:	Preprint
Publié:	2023
Sujets:	Quantum Physics Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding
par: Gu, Shouzhen, et autres
Publié: (2026)

Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
par: Martinez, Victor, et autres
Publié: (2025)

On the Pauli Spectrum of QAC0
par: Nadimpalli, Shivam, et autres
Publié: (2023)

Pauli Measurements Are Near-Optimal for Single-Qubit Tomography
par: Acharya, Jayadev, et autres
Publié: (2025)

Efficient approximate unitary designs from random Pauli rotations
par: Haah, Jeongwan, et autres
Publié: (2024)

Forrelation is Extremally Hard
par: Girish, Uma, et autres
Publié: (2025)

Free Fermion Distributions Are Hard to Learn
par: Nietner, Alexander
Publié: (2023)

Hardness of approximation for ground state problems
par: Gharibian, Sevag, et autres
Publié: (2024)

Improved Hardness Results for the Guided Local Hamiltonian Problem
par: Cade, Chris, et autres
Publié: (2022)

Quantum Advantage from Sampling Shallow Circuits: Beyond Hardness of Marginals
par: Grier, Daniel, et autres
Publié: (2025)

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture
par: Gharibian, Sevag, et autres
Publié: (2021)

Complexity of Quadratic Bosonic Hamiltonian Simulation: $\mathsf{BQP}$-Completeness and $\mathsf{PostBQP}$-Hardness
par: Zschetzsche, Lilith, et autres
Publié: (2026)

On the Computational Hardness of Quantum One-Wayness
par: Cavalar, Bruno, et autres
Publié: (2023)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
par: Morimae, Tomoyuki, et autres
Publié: (2025)

Hardness of Quantum Distribution Learning and Quantum Cryptography
par: Hiroka, Taiga, et autres
Publié: (2025)

The Complexity of Stoquastic Sparse Hamiltonians
par: Grilo, Alex B., et autres
Publié: (2026)

Quantum SAT Problems with Finite Sets of Projectors are Complete for a Plethora of Classes
par: Cardoso, Ricardo Rivera, et autres
Publié: (2025)

StoqMA vs. MA: the power of error reduction
par: Aharonov, Dorit, et autres
Publié: (2020)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
par: Arteche, Noel, et autres
Publié: (2024)

Magic and communication complexity
par: Girish, Uma, et autres
Publié: (2025)

Fast simulation of planar Clifford circuits
par: Gosset, David, et autres
Publié: (2020)

Dequantization and Hardness of Spectral Sum Estimation
par: Edenhofer, Roman, et autres
Publié: (2025)

The Power of Shallow-depth Toffoli and Qudit Quantum Circuits
par: Grilo, Alex Bredariol, et autres
Publié: (2024)

Pseudorandom unitaries are neither real nor sparse nor noise-robust
par: Haug, Tobias, et autres
Publié: (2023)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
par: Morimae, Tomoyuki, et autres
Publié: (2025)

NLTS Hamiltonians from good quantum codes
par: Anshu, Anurag, et autres
Publié: (2022)

Efficient Pauli channel estimation with logarithmic quantum memory
par: Chen, Sitan, et autres
Publié: (2023)

Transversal non-Clifford gates for quantum LDPC codes on sheaves
par: Lin, Ting-Chun
Publié: (2024)

Expansion of higher-dimensional cubical complexes with application to quantum locally testable codes
par: Dinur, Irit, et autres
Publié: (2024)

The Round Complexity of Proofs in the Bounded Quantum Storage Model
par: Grilo, Alex B., et autres
Publié: (2024)

Uniformity testing when you have the source code
par: Canonne, Clément L., et autres
Publié: (2024)

Hardness of recognizing phases of matter
par: Schuster, Thomas, et autres
Publié: (2025)

The Role of piracy in quantum proofs
par: Broadbent, Anne, et autres
Publié: (2024)

Tight Bounds for Quantum Phase Estimation and Related Problems
par: Mande, Nikhil S., et autres
Publié: (2023)

Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture
par: Weggemans, Jordi, et autres
Publié: (2023)

Some Implications of the Independence Postulate for Physics
par: Epstein, Samuel
Publié: (2023)

Quantum and Classical Communication Complexity of Permutation-Invariant Functions
par: Guan, Ziyi, et autres
Publié: (2023)

Hamiltonians whose low-energy states require $Ω(n)$ T gates
par: Coble, Nolan J., et autres
Publié: (2023)

On the exact quantum query complexity of $\text{MOD}_m^n$ and $\text{EXACT}_{k,l}^n$
par: Yao, Penghui, et autres
Publié: (2023)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
par: Delavenne, Hugo, et autres
Publié: (2023)