Journal
NEW JOURNAL OF PHYSICS
Volume 20, Issue -, Pages -Publisher
IOP PUBLISHING LTD
DOI: 10.1088/1367-2630/aae94a
Keywords
quantum computing; machine-learning; state overlap
Categories
Funding
- US Department of Energy through the J. Robert Oppenheimer fellowship
- LDRD program at Los Alamos National Laboratory (LANL)
- LANL ASC Beyond Moore's Law project
Ask authors/readers for more resources
Short-depth algorithms are crucial for reducing computational error on near-term quantum computers, for which decoherence and gate infidelity remain important issues. Here we present a machine-learning approach for discovering such algorithms. We apply our method to a ubiquitous primitive: computing the overlap Tr(rho sigma) between two quantum states rho and sigma. The standard algorithm for this task, known as the Swap Test, is used in many applications such as quantum support vector machines, and, when specialized to rho = sigma, quantifies the Renyi entanglement. Here, we find algorithms that have shorter depths than the Swap Test, including one that has a constant depth (independent of problem size). Furthermore, we apply our approach to the hardware-specific connectivity and gate sets used by Rigetti's and IBM's quantum computers and demonstrate that the shorter algorithms that we derive significantly reduce the error-compared to the Swap Test-on these computers.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available