:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Malz, Daniel, Trivedi, Rahul
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Computational Complexity
Acceso en línea:	https://arxiv.org/abs/2402.07975
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

Magic and communication complexity
por: Girish, Uma, et al.
Publicado: (2025)

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

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

Direct sum theorems beyond query complexity
por: Suruga, Daiki
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Bosonic Quantum Computational Complexity
por: Chabaud, Ulysse, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

Why Philosophers Should Care About Computational Complexity
por: Aaronson, Scott
Publicado: (2011)

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