9 code implementations • 24 Dec 2018 • Yudong Cao, Jonathan Romero, Jonathan P. Olson, Matthias Degroote, Peter D. Johnson, Mária Kieferová, Ian D. Kivlichan, Tim Menke, Borja Peropadre, Nicolas P. D. Sawaya, Sukin Sim, Libor Veis, Alán Aspuru-Guzik
Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century.
Quantum Physics
1 code implementation • 29 Aug 2018 • Gregory R. Steinbrecher, Jonathan P. Olson, Dirk Englund, Jacques Carolan
Physically motivated quantum algorithms for specific near-term quantum hardware will likely be the next frontier in quantum information science.
Quantum Physics
2 code implementations • 27 Aug 2018 • Eric R. Anschuetz, Jonathan P. Olson, Alán Aspuru-Guzik, Yudong Cao
In this work, we revisit the problem of factoring, developing an alternative to Shor's algorithm, which employs established techniques to map the factoring problem to the ground state of an Ising Hamiltonian.
Quantum Physics
4 code implementations • 8 Dec 2016 • Jonathan Romero, Jonathan P. Olson, Alan Aspuru-Guzik
The quantum autoencoder is trained to compress a particular dataset of quantum states, where a classical compression algorithm cannot be employed.
Quantum Physics
no code implementations • 26 Jun 2014 • Bryan T. Gard, Keith R. Motes, Jonathan P. Olson, Peter P. Rohde, Jonathan P. Dowling
Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer.
Quantum Physics
