:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Rayudu, Chaithanya
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity
Online Access:	https://arxiv.org/abs/2411.03230
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

QMA vs. QCMA and Pseudorandomness
by: Liu, Jiahui, et al.
Published: (2024)

Superposition detection and QMA with non-collapsing measurements
by: Bassirian, Roozbeh, et al.
Published: (2024)

Oracle separation of QMA and QCMA with bounded adaptivity
by: Ben-David, Shalev, et al.
Published: (2024)

Two bases suffice for QMA1-completeness
by: Ma, Henry, et al.
Published: (2025)

Towards a universal gateset for $\mathsf{QMA}_1$
by: Rudolph, Dorian
Published: (2024)

Toward Separating QMA from QCMA with a Classical Oracle
by: Zhandry, Mark
Published: (2024)

The rotation-invariant Hamiltonian problem is QMA$_{\rm EXP}$-complete
by: Nelson, Jon, et al.
Published: (2025)

PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
by: Aaronson, Scott, et al.
Published: (2024)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
by: Miloschewsky, David, et al.
Published: (2026)

Separating QMA from QCMA with a classical oracle
by: Bostanci, John, et al.
Published: (2025)

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

Free Fermion Distributions Are Hard to Learn
by: Nietner, Alexander
Published: (2023)

Fast mixing of operator-loop path-integral quantum Monte Carlo for stoquastic XY Hamiltonians
by: Rayudu, Chaithanya, et al.
Published: (2025)

On the hardness of cloning and connections to representation theory
by: Havlíček, Vojtěch, et al.
Published: (2024)

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

Complexity and hardness of random peaked circuits
by: Zhang, Yuxuan
Published: (2025)

DQC1-hardness of estimating correlation functions
by: Moulik, Subhayan Roy, et al.
Published: (2024)

Quantum Max-Cut is NP hard to approximate
by: Piddock, Stephen
Published: (2025)

How hard is it to verify a classical shadow?
by: Karaiskos, Georgios, et al.
Published: (2025)

Exponential improvements to the average-case hardness of BosonSampling
by: Bouland, Adam, et al.
Published: (2024)

Exact Quantum Circuit Optimization is co-NQP-hard
by: Kjelstrøm, Adam Husted, et al.
Published: (2025)

Some Implications of the Independence Postulate for Physics
by: Epstein, Samuel
Published: (2023)

Dimension Independent Disentanglers from Unentanglement and Applications
by: Jeronimo, Fernando G., et al.
Published: (2024)

Fermionic Gaussian Testing and Non-Gaussian Measures via Convolution
by: Lyu, Xingjian, et al.
Published: (2024)

Approximating the quantum value of an LCS game is RE-hard
by: Taller, Aviv, et al.
Published: (2025)

The color code, the surface code, and the transversal CNOT: NP-hardness of minimum-weight decoding
by: Gu, Shouzhen, et al.
Published: (2026)

Magic and communication complexity
by: Girish, Uma, et al.
Published: (2025)

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

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

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

Constrained local Hamiltonians: quantum generalizations of Vertex Cover
by: Parekh, Ojas, et al.
Published: (2024)

Computational complexity of isometric tensor network states
by: Malz, Daniel, et al.
Published: (2024)

Direct sum theorems beyond query complexity
by: Suruga, Daiki
Published: (2024)

Separations in query complexity for total search problems
by: Ben-David, Shalev, et al.
Published: (2024)

On query complexity measures and their relations for symmetric functions
by: Mittal, Rajat, et al.
Published: (2021)

Quantum and classical query complexities of functions of matrices
by: Montanaro, Ashley, et al.
Published: (2023)

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

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

On the communication complexity of finding a king in a tournament
by: Mande, Nikhil S., et al.
Published: (2024)

On the complexity of estimating ground state entanglement and free energy
by: Gharibian, Sevag, et al.
Published: (2025)