New answers tagged complexity-theory
0
votes
Is it known whether the Fermi-Hubbard ground state can be prepared efficiently or not?
In this paper, Schuch and Verstraete determined the computational complexity of finding the ground state of the Fermi-Hubbard model, showing that it is among the hardest problems in the complexity ...
- 687
-2
votes
Are there many practical problems for which Grover's algorithm beats the best heuristic classical algorithm?
Quantum sensing: Say you have a 3 dimensional array of qubits each one being sensitive to a change in environment eg temperature or distortion of the lattice. The position of the changed qubit is ...
Top 50 recent answers are included
Related Tags
complexity-theory × 229algorithm × 74
speedup × 18
bqp × 18
quantum-advantage × 17
qma × 17
quantum-gate × 16
grovers-algorithm × 15
resource-request × 14
classical-computing × 14
circuit-construction × 13
quantum-circuit × 12
mathematics × 8
hamiltonian-simulation × 8
oracles × 8
random-quantum-circuit × 8
quantum-state × 7
simulation × 7
cryptography × 7
shors-algorithm × 6
entanglement × 5
nielsen-and-chuang × 5
quantum-fourier-transform × 5
optimization × 5
deutsch-jozsa-algorithm × 5