Quasi-polynomial Time Approximation of Output Probabilities of Constant-depth, Geometrically-local Quantum Circuits.
Nolan J. CobleMatthew CoudronPublished in: CoRR (2020)
Keyphrases
- polynomial time approximation
- quantum computing
- logic circuits
- np hard
- probability values
- error bounds
- approximation algorithms
- logic synthesis
- depth information
- probability distribution
- depth map
- identical machines
- high speed
- belief networks
- quantum inspired
- bin packing
- constant factor
- probability theory
- multi view
- input data
- simulated annealing
- worst case
- computational complexity
- learning algorithm