Corpus ID: 216870486

Coreset Clustering on Small Quantum Computers

@article{Tomesh2020CoresetCO,
  title={Coreset Clustering on Small Quantum Computers},
  author={Teague Tomesh and Pranav Gokhale and Eric R. Anschuetz and F. Chong},
  journal={ArXiv},
  year={2020},
  volume={abs/2004.14970}
}
Many quantum algorithms for machine learning require access to classical data in superposition. However, for many natural data sets and algorithms, the overhead required to load the data set in superposition can erase any potential quantum speedup over classical algorithms. Recent work by Harrow introduces a new paradigm in hybrid quantum-classical computing to address this issue, relying on coresets to minimize the data loading overhead of quantum algorithms. We investigate using this paradigm… Expand
2 Citations

References

SHOWING 1-10 OF 41 REFERENCES
Small quantum computers and large classical data sets
  • 6
  • Highly Influential
  • PDF
Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
  • 98
  • PDF
Unsupervised Machine Learning on a Hybrid Quantum Computer
  • 133
  • PDF
Generalized swap networks for near-term quantum computing
  • 21
  • PDF
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case
  • 30
  • PDF
Quantum supremacy using a programmable superconducting processor
  • 1,427
  • PDF
Full-Stack, Real-System Quantum Computer Studies: Architectural Comparisons and Design Insights
  • 46
  • PDF
A fast quantum mechanical algorithm for database search
  • 4,874
  • PDF
A Quantum Approximate Optimization Algorithm
  • 716
  • PDF
...
1
2
3
4
5
...