:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Malz, Daniel, Trivedi, Rahul
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity
Online Access:	https://arxiv.org/abs/2402.07975
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Area laws and tensor networks for maximally mixed ground states
by: Arad, Itai, et al.
Published: (2023)

Circuit-to-Hamiltonian from tensor networks and fault tolerance
by: Anshu, Anurag, et al.
Published: (2023)

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

Positive bias makes tensor-network contraction tractable
by: Jiang, Jiaqing, et al.
Published: (2024)

Random regular graph states are complex at almost any depth
by: Ghosh, Soumik, et al.
Published: (2024)

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

Learning quantum states and unitaries of bounded gate complexity
by: Zhao, Haimeng, et al.
Published: (2023)

Quantum information advantage based on Bell inequalities
by: Jain, Rahul, et al.
Published: (2026)

Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
by: Barch, Brian, et al.
Published: (2025)

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

Computational complexity of the homology problem with orientable filtration: MA-completeness
by: Hayakawa, Ryu, et al.
Published: (2025)

Quantum computational complexity of matrix functions
by: Cifuentes, Santiago, 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)

Computational complexity of Berry phase estimation in topological phases of matter
by: Hayakawa, Ryu, et al.
Published: (2025)

On classical advice, sampling advice and complexity assumptions for learning separations
by: Pérez-Guijarro, Jordi
Published: (2024)

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

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

Quantum state testing with restricted measurements
by: Liu, Yuhan, et al.
Published: (2024)

Hardness of approximation for ground state problems
by: Gharibian, Sevag, et al.
Published: (2024)

Quantum state isomorphism problems for groups
by: Gheorghiu, Alexandru, et al.
Published: (2026)

Quantum complexity of the Kronecker coefficients
by: Bravyi, Sergey, et al.
Published: (2023)

The Power of Lorentz Quantum Computer
by: Zhang, Qi, et al.
Published: (2024)

Bosonic Quantum Computational Complexity
by: Chabaud, Ulysse, et al.
Published: (2024)

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

Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
by: Suruga, Daiki
Published: (2025)

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

The Space-Time Cost of Purifying Quantum Computations
by: Zhandry, Mark
Published: (2024)

The Computational Advantage of MIP* Vanishes in the Presence of Noise
by: Dong, Yangjing, et al.
Published: (2023)

Computational aspects of the trace norm contraction coefficient
by: Delsol, Idris, et al.
Published: (2025)

Modifications of Quantum Computation and Adaptive Queries to PP
by: Miloschewsky, David, et al.
Published: (2025)

Quantum Merlin-Arthur proof systems for synthesizing quantum states
by: Delavenne, Hugo, et al.
Published: (2023)

On the exact quantum query complexity of $\text{MOD}_m^n$ and $\text{EXACT}_{k,l}^n$
by: Yao, Penghui, et al.
Published: (2023)

Why Philosophers Should Care About Computational Complexity
by: Aaronson, Scott
Published: (2011)

New Quantum Algorithms for Computing Quantum Entropies and Distances
by: Wang, Qisheng, et al.
Published: (2022)