Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture (Q6083456): Difference between revisions

Latest revision as of 18:54, 2 August 2024

scientific article; zbMATH DE number 7774317

Language	Label	Description	Also known as
English	Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture	scientific article; zbMATH DE number 7774317

Statements

instance of

scholarly article

0 references

title

Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture (English)

0 references

Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture (English)

0 references

0 references

0 references

Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing

0 references

SIAM Journal on Computing

0 references

publication date

8 December 2023

0 references

6 September 2023

0 references

full work available at URL

https://arxiv.org/abs/2111.09079

0 references

zbMATH Keywords

quantum singular value transform

0 references

dequantization

0 references

local Hamiltonian

0 references

quantum PCP

0 references

quantum chemistry

0 references

quantum singular-value transform

0 references

quantum PCP conjecture

0 references

BQP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

The computational complexity of linear optics

0 references

Adiabatic quantum state generation and statistical zero knowledge

0 references

EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS

0 references

Quantum Supremacy and the Complexity of Random Circuit Sampling

0 references

Product-state approximations to quantum ground states

0 references

Q4819589

0 references

Fermionic quantum computation

0 references

Q5091183

0 references

Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning

0 references

Q6065454

0 references

The complexity of theorem-proving procedures

0 references

Fast monte-carlo algorithms for finding low-rank approximations

0 references

Quantum Hamiltonian Complexity

0 references

Approximation Algorithms for QMA-Complete Problems

0 references

Hardness of Approximation for Quantum Problems

0 references

Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture

0 references

Q4637976

0 references

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

0 references

QMA with Subset State Witnesses

0 references

Q4228473

0 references

Random generation of combinatorial structures from a uniform distribution

0 references

Q5089222

0 references

Q4544834

0 references

Q6161144

0 references

Universal Quantum Simulators

0 references

Search via Quantum Walk

0 references

Quantum speedup of Monte Carlo methods

0 references

A quantum-inspired classical algorithm for recommendation systems

0 references

Q3101851

0 references

Mapping local Hamiltonians of fermions to local Hamiltonians of spins

0 references

Identifiers

arXiv ID

2111.09079

0 references

DOI

10.1145/3519935.3519991

0 references

10.1137/22m1513721

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH Open document ID

1520.68041

0 references

Wikidata QID

Q122911151

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6083456

@@ Property / cites work @@
+The computational complexity of linear optics
@@ Property / cites work: The computational complexity of linear optics / rank @@
+Normal rank
@@ Property / cites work @@
+Adiabatic quantum state generation and statistical zero knowledge
+Normal rank
@@ Property / cites work @@
+EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
+Normal rank
@@ Property / cites work @@
+Quantum Supremacy and the Complexity of Random Circuit Sampling
+Normal rank
@@ Property / cites work @@
+Product-state approximations to quantum ground states
+Normal rank
@@ Property / cites work @@
+Q4819589
@@ Property / cites work: Q4819589 / rank @@
+Normal rank
@@ Property / cites work @@
+Fermionic quantum computation
@@ Property / cites work: Fermionic quantum computation / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091183
@@ Property / cites work: Q5091183 / rank @@
+Normal rank
@@ Property / cites work @@
+Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing Quantum machine learning
+Normal rank
@@ Property / cites work @@
+Q6065454
@@ Property / cites work: Q6065454 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Fast monte-carlo algorithms for finding low-rank approximations
+Normal rank
@@ Property / cites work @@
+Quantum Hamiltonian Complexity
@@ Property / cites work: Quantum Hamiltonian Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for QMA-Complete Problems
+Normal rank
@@ Property / cites work @@
+Hardness of Approximation for Quantum Problems
@@ Property / cites work: Hardness of Approximation for Quantum Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture
+Normal rank
@@ Property / cites work @@
+Q4637976
@@ Property / cites work: Q4637976 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
+Normal rank
@@ Property / cites work @@
+QMA  with Subset State Witnesses
@@ Property / cites work: QMA with Subset State Witnesses / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Q5089222
@@ Property / cites work: Q5089222 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4544834
@@ Property / cites work: Q4544834 / rank @@
+Normal rank
@@ Property / cites work @@
+Q6161144
@@ Property / cites work: Q6161144 / rank @@
+Normal rank
@@ Property / cites work @@
+Universal Quantum Simulators
@@ Property / cites work: Universal Quantum Simulators / rank @@
+Normal rank
@@ Property / cites work @@
+Search via Quantum Walk
@@ Property / cites work: Search via Quantum Walk / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum speedup of Monte Carlo methods
@@ Property / cites work: Quantum speedup of Monte Carlo methods / rank @@
+Normal rank
@@ Property / cites work @@
+A quantum-inspired classical algorithm for recommendation systems
+Normal rank
@@ Property / cites work @@
+Q3101851
@@ Property / cites work: Q3101851 / rank @@
+Normal rank
@@ Property / cites work @@
+Mapping local Hamiltonians of fermions to local Hamiltonians of spins
+Normal rank