Image de couverture de livre

On the Complexity of Pure-State Consistency of Local Density Matrices

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kamminga, Jonas, Rudolph, Dorian
Format:	Preprint
Publié:	2024
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

On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity
par: Grewal, Sabee, et autres
Publié: (2025)

BQP, meet NP: Search-to-decision reductions and approximate counting
par: Gharibian, Sevag, et autres
Publié: (2024)

On the complexity of estimating ground state entanglement and free energy
par: Gharibian, Sevag, et autres
Publié: (2025)

Towards a universal gateset for $\mathsf{QMA}_1$
par: Rudolph, Dorian
Publié: (2024)

Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
par: Rudolph, Dorian, et autres
Publié: (2024)

An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
par: Aldi, Marco, et autres
Publié: (2024)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
par: Miloschewsky, David, et autres
Publié: (2026)

Bounding the computational power of bosonic systems
par: Upreti, Varun, et autres
Publié: (2025)

Quantum k-SAT Related Hypergraph Problems
par: Kremer, Simon-Luca, et autres
Publié: (2025)

Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
par: Agarwal, Avantika, et autres
Publié: (2024)

On the Complexity of the Succinct State Local Hamiltonian Problem
par: Waite, Gabriel, et autres
Publié: (2025)

How hard is it to verify a classical shadow?
par: Karaiskos, Georgios, et autres
Publié: (2025)

Complexity Classification of Product State Problems for Local Hamiltonians
par: Kallaugher, John, et autres
Publié: (2024)

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States
par: Cade, Chris, et autres
Publié: (2022)

Quantum PCPs: on Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
par: Buhrman, Harry, et autres
Publié: (2024)

The Complexity of Local Stoquastic Hamiltonians on 2D Lattices
par: Waite, Gabriel, et autres
Publié: (2025)

Physically-Motivated Guiding States for Local Hamiltonians
par: Waite, Gabriel, et autres
Publié: (2025)

Local Test for Unitarily Invariant Properties of Bipartite Quantum States
par: Chen, Kean, et autres
Publié: (2024)

Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
par: Delavenne, Hugo, et autres
Publié: (2024)

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

Quantum Complexity vs Classical Complexity: A Survey
par: Vaezi, Arash, et autres
Publié: (2023)

Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom
par: Grewal, Sabee, et autres
Publié: (2022)

Bosonic Quantum Computational Complexity
par: Chabaud, Ulysse, et autres
Publié: (2024)

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

On the Complexity of Decoded Quantum Interferometry
par: Marwaha, Kunal, et autres
Publié: (2025)

Complexity Theory for Quantum Promise Problems
par: Chia, Nai-Hui, et autres
Publié: (2024)

The Communication Complexity of Approximating Matrix Rank
par: Sherstov, Alexander A., et autres
Publié: (2024)

Complexity and hardness of random peaked circuits
par: Zhang, Yuxuan
Publié: (2025)

On the complexity of unique quantum witnesses and quantum approximate counting
par: Anshu, Anurag, et autres
Publié: (2024)

A Brief Introduction to Quantum Query Complexity
par: Hamoudi, Yassine
Publié: (2025)

A Note on the Complexity of the Spectral Gap Problem
par: Yirka, Justin
Publié: (2025)

Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
par: Wang, Qisheng
Publié: (2024)

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

Why Philosophers Should Care About Computational Complexity
par: Aaronson, Scott
Publié: (2011)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
par: Barch, Brian, et autres
Publié: (2025)

Fine-Grained Complexity via Quantum Natural Proofs
par: Chen, Yanlin, et autres
Publié: (2025)

Commuting Local Hamiltonians Beyond 2D
par: Bostanci, John, et autres
Publié: (2024)

The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians
par: Waite, Gabriel
Publié: (2025)

Maximum Separation of Quantum Communication Complexity With and Without Shared Entanglement
par: Hasegawa, Atsuya, et autres
Publié: (2025)

A Lifting Theorem for Hybrid Classical-Quantum Communication Complexity
par: Wu, Xudong, et autres
Publié: (2025)