Image de couverture de livre

On the hardness of cloning and connections to representation theory

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Havlíček, Vojtěch, Nirkhe, Chinmay
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

The status of the quantum PCP conjecture (games version)
par: Natarajan, Anand, et autres
Publié: (2024)

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

Separating QMA from QCMA with a classical oracle
par: Bostanci, John, et autres
Publié: (2025)

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

Quantum complexity of the Kronecker coefficients
par: Bravyi, Sergey, et autres
Publié: (2023)

Optimising quantum circuits is generally hard
par: van de Wetering, John, et autres
Publié: (2023)

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

DQC1-hardness of estimating correlation functions
par: Moulik, Subhayan Roy, et autres
Publié: (2024)

Quantum Max-Cut is NP hard to approximate
par: Piddock, Stephen
Publié: (2025)

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

Exponential improvements to the average-case hardness of BosonSampling
par: Bouland, Adam, et autres
Publié: (2024)

Exact Quantum Circuit Optimization is co-NQP-hard
par: Kjelstrøm, Adam Husted, et autres
Publié: (2025)

Fermionic Independent Set and Laplacian of an independence complex are QMA-hard
par: Rayudu, Chaithanya
Publié: (2024)

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

A Computational Separation Between Quantum No-cloning and No-telegraphing
par: Nehoran, Barak, et autres
Publié: (2023)

Approximating the quantum value of an LCS game is RE-hard
par: Taller, Aviv, et autres
Publié: (2025)

A distribution testing oracle separation between QMA and QCMA
par: Natarajan, Anand, et autres
Publié: (2022)

Constructing $\mathrm{NP}^{\mathord{\#}\mathrm P}$-complete problems and ${\mathord{\#}\mathrm P}$-hardness of circuit extraction in phase-free ZH
par: Mitosek, Piotr
Publié: (2024)

Efficient quantum circuits for high-dimensional representations of SU(n) and Ramanujan quantum expanders
par: Iyer, Vishnu, et autres
Publié: (2026)

Computational hardness of estimating quantum entropies via binary entropy bounds
par: Liu, Yupan
Publié: (2026)

Fault-tolerant compiling of classically hard IQP circuits on hypercubes
par: Hangleiter, Dominik, et autres
Publié: (2024)

Topics in Non-local Games: Synchronous Algebras, Algebraic Graph Identities, and Quantum NP-hardness Reductions
par: He, Entong
Publié: (2024)

On the hardness of learning ground state entanglement of geometrically local Hamiltonians
par: Bouland, Adam, et autres
Publié: (2024)

Directed st-connectivity with few paths is in quantum logspace
par: Apers, Simon, et autres
Publié: (2024)

Polynomial time classical versus quantum algorithms for representation theoretic multiplicities
par: Panova, Greta
Publié: (2025)

Rapidly mixing loop representation quantum Monte Carlo for Heisenberg models on star-like bipartite graphs
par: Takahashi, Jun, et autres
Publié: (2024)

Undecidability and incompleteness in quantum information theory and operator algebras
par: Goldbring, Isaac
Publié: (2024)

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

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

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

Dimension Independent Disentanglers from Unentanglement and Applications
par: Jeronimo, Fernando G., et autres
Publié: (2024)

Two prover perfect zero knowledge for MIP*
par: Mastel, Kieran, et autres
Publié: (2024)

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

Quantum Threshold is Powerful
par: Grier, Daniel, et autres
Publié: (2024)

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

Efficient approximate unitary designs from random Pauli rotations
par: Haah, Jeongwan, et autres
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)

Oracle Separation between Noisy Quantum Polynomial Time and the Polynomial Hierarchy
par: Chia, Nai-Hui, et autres
Publié: (2024)

Computational complexity of isometric tensor network states
par: Malz, Daniel, et autres
Publié: (2024)

A Quantum Unique Games Conjecture
par: Mousavi, Hamoon, et autres
Publié: (2024)