Imagen de Portada

A full dichotomy for Holant$^c$, inspired by quantum computation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Backens, Miriam
Formato:	Preprint
Publicado:	2022
Materias:	Computational Complexity Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

From an odd arity signature to a Holant dichotomy
por: Meng, Boning, et al.
Publicado: (2025)

Symmetric quantum computation
por: Castro-Silva, Davi, et al.
Publicado: (2025)

Lower bounds for quantum-inspired classical algorithms via communication complexity
por: Mande, Nikhil S., et al.
Publicado: (2024)

Towards a complexity-theoretic dichotomy for TQFT invariants
por: Bridges, Nicolas, et al.
Publicado: (2025)

Physical complexity and black hole quantum computers
por: Reilly, Michele, et al.
Publicado: (2025)

Improved separation between quantum and classical computers for sampling and functional tasks
por: Marshall, Simon C., et al.
Publicado: (2024)

Whether a quantum computation employs nonlocal resources is operationally undecidable
por: Fields, Chris, et al.
Publicado: (2025)

On the quantum computational complexity of classical linear dynamics with geometrically local interactions: Dequantization and universality
por: Sakamoto, Kazuki, et al.
Publicado: (2025)

Parameterised Holant Problems
por: Aivasiliotis, Panagiotis, et al.
Publicado: (2024)

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

Quantum computation with indefinite causal structures
por: Araújo, Mateus, et al.
Publicado: (2017)

Bounding the computational power of bosonic systems
por: Upreti, Varun, et al.
Publicado: (2025)

Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow
por: Backens, Miriam, et al.
Publicado: (2025)

Robust and optimal loading of general classical data into quantum computers
por: Zhang, Xiao-Ming
Publicado: (2024)

The computational two-way quantum capacity
por: Meyer, Johannes Jakob, et al.
Publicado: (2026)

Quasi-quantum states and the quasi-quantum PCP theorem
por: Arad, Itai, et al.
Publicado: (2024)

On the complexity of unique quantum witnesses and quantum approximate counting
por: Anshu, Anurag, et al.
Publicado: (2024)

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

Efficiently verifiable quantum advantage on near-term analog quantum simulators
por: Liu, Zhenning, et al.
Publicado: (2024)

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

A simplified version of the quantum OTOC$^{(2)}$ problem
por: King, Robbie, et al.
Publicado: (2025)

Holant* Dichotomy on Domain Size 3: A Geometric Perspective
por: Cai, Jin-Yi, et al.
Publicado: (2025)

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

A combinatorial view of Holant problems on higher domains
por: Liu, Yin
Publicado: (2024)

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

The 7 faces of quantum NP
por: Gharibian, Sevag
Publicado: (2023)

Improved quantum data analysis
por: Bădescu, Costin, et al.
Publicado: (2020)

Beating full state tomography for unentangled spectrum estimation
por: Pelecanos, Angelos, et al.
Publicado: (2025)

Space-bounded quantum state testing via space-efficient quantum singular value transformation
por: Gall, François Le, et al.
Publicado: (2023)

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

A note on quantum lower bounds for local search via congestion and expansion
por: Brânzei, Simina, et al.
Publicado: (2024)

Peaked quantum advantage using error correction
por: Deshpande, Abhinav, et al.
Publicado: (2025)

The status of the quantum PCP conjecture (games version)
por: Natarajan, Anand, et al.
Publicado: (2024)

Space-bounded quantum interactive proof systems
por: Gall, François Le, et al.
Publicado: (2024)

Even quantum advice is unlikely to solve PP
por: Yirka, Justin
Publicado: (2024)

An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems via computational learning theory
por: Pirnay, Niklas, et al.
Publicado: (2022)

The membership problem for constant-sized quantum correlations is undecidable
por: Fu, Honghao, et al.
Publicado: (2021)

Finding quantum partial assignments by search-to-decision reductions
por: Weggemans, Jordi
Publicado: (2024)

Derandomised tensor product gap amplification for quantum Hamiltonians
por: Bergamaschi, Thiago, et al.
Publicado: (2025)

Distributed inner product estimation with limited quantum communication
por: Arunachalam, Srinivasan, et al.
Publicado: (2024)