Fetching the paper…
Reading the bibliography…
As the effort to scale up existing quantum hardware proceeds, it becomes necessary to schedule quantum gates in a way that minimizes the number of operations.
Bounds for certain multiprocessing anomalies
Ronald L Graham · 1966
Earlier work this paper cites.
Reducing the bandwidth of sparse symmetric matrices
E. Cuthill and J. McKee · 1969
Earlier work this paper cites.
An algorithm for reducing the bandwidth and profile of a sparse matrix
Norman E. Gibbs, William G. Poole, and Paul K. Stockmeyer · 1976
Earlier work this paper cites.
Computers and Intractability; A Guide to the Theory of NP-Completeness
Michael R. Garey and David S. Johnson · 1990
Earlier work this paper cites.
Unified assign and schedule: A new approach to scheduling for clustered register file microarchitectures
Emre Özer, Sanjeev Banerjia, and Thomas M. Conte · 1998
Earlier work this paper cites.
An experimental evaluation of list scheduling
Keith D. Cooper, Philip J. Schielke, and Devika Subramanian · 1998
Earlier work this paper cites.
The Boost Graph Library: User Guide and Reference Manual
Jeremy Siek, Lie-Quan Lee, and Andrew Lumsdaine · 2002
Earlier work this paper cites.
Entangled states of trapped atomic ions
Rainer Blatt and David Wineland · 2008
Earlier work this paper cites.
Quantum annealing with manufactured spins
M. W. Johnson, Mohammad H. S. Amin, S. Gildert, T. Lanting, F. Hamze, Neil G. Dickson, R. Harris, A. J. Berkley, J. Johansson, P. Bunyk, E. M. Chapple, C. Enderud, J. P. Hilton, Kamran Karimi, E. Ladizinsky, N. Ladizinsky, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, C. J. S. Truncik, S. Uchaikin, J. Wang, B. Wilson, and Geordie Rose · 2011
Earlier work this paper cites.
The maximum common edge subgraph problem: A polyhedral investigation
Laura Bahiense, Gordana Manić, Breno Piva, and Cid C. De Souza · 2012
Earlier work this paper cites.
Efficient distributed quantum computing
Robert Beals, Stephen Brierley, Oliver Gray, Aram W Harrow, Samuel Kutin, Noah Linden, Dan Shepherd, Mark Stather, and Stephen Brierley · 2013
Cited alongside, same era.
Dave Wecker and Krysta M. Svore · 2014
Cited alongside, same era.
A quantum approximate optimization algorithm
Edward Farhi, Jeffrey Goldstone, and Sam Gutmann · 2014
Cited alongside, same era.
Efficient implementation of Quantum circuits with limited qubit interactions
Stephen Brierley · 2015
Cited alongside, same era.
Performing quantum computing experiments in the cloud
Simon J. Devitt · 2016
Cited alongside, same era.
ProjectQ: An open source software framework for quantum computing
Damian S. Steiger, H. Thomas, and Matthias Troyer · 2016
Later among the works it cites.
Compiling quantum algorithms for architectures with multi-qubit gates
Esteban A. Martinez, Thomas Monz, Daniel Nigg, Philipp Schindler, and Rainer Blatt · 2016
Later among the works it cites.
Characterizing quantum supremacy in near-term devices
Sergio Boixo, Sergei V. Isakov, Vadim N. Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, John M. Martinis, and Hartmut Neven · 2016
Later among the works it cites.
Training a quantum optimizer
Dave Wecker, Matthew B. Hastings, and Matthias Troyer · 2016
Later among the works it cites.
Large-scale quantum photonic circuits in silicon
Nicholas C. Harris, Darius Bunandar, Mihir Pant, Greg R. Steinbrecher, Jacob Mower, Mihika Prabhu, Tom Baehr-Jones, Michael Hochberg, and Dirk Englund · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Digitized adiabatic quantum computing with a superconducting circuit
Rami Barends, Alireza Shabani, L. Lamata, J. Kelly, A. Mezzacapo, U. Las Heras, Ryan Babbush, Austin G. Fowler, B. Campbell, Yu Chen, Z. Chen, B. Chiaro, A. Dunsworth, E. Jeffrey, E. Lucero, A. Megrant, J. Y. Mutus, M. Neeley, Charles Neill, P. J. J. O’Malley, C. Quintana, Pedran Roushan, A. Vainsencher, J. Wenner, T. C. White, Enrique Solano, Hartmut Neven, and John M. Martinis · 2016
Cited alongside, same era.
Scalable quantum circuit and control for a superconducting surface code
R. Versluis, S. Poletto, N. Khammassi, N. Haider, D. J. Michalak, A. Bruno, Koen Bertels, and Leo DiCarlo · 2016
Cited alongside, same era.
A functional architecture for scalable quantum computing
Eyob A. Sete, William J. Zeng, and Chad T. Rigetti · 2016
Cited alongside, same era.
A practical quantum instruction set architecture
Robert S. Smith, Michael J. Curtis, and William J. Zeng · 2016
Cited alongside, same era.
https://www.research.ibm.com/ibm-q/, 2017
IBM Q · 2017
Closest in time.
Practical optimization for hybrid quantum-classical algorithms
Gian Giacomo Guerreschi and Mikhail Smelyanskiy · 2017
Closest in time.
Unsupervised machine learning on a hybrid quantum computer
J. S. Otterbach, R. Manenti, N. Alidoust, A. Bestwick, M. Block, B. Bloom, S. Caldwell, N. Didier, E. Schuyler Fried, S. Hong, P. Karalekas, C. B. Osborn, A. Papageorge, E. C. Peterson, G. Prawiroatmodjo, N. Rubin, C. A. Ryan, D. Scarabelli, M. Scheer, E. A. Sete, P. Sivarajah, R. S. Smith, A. Staley, N. Tezak, W. J. Zeng, A. Hudson, B. R. Johnson, M. Reagor, M. P. da Silva, and Chad Rigetti · 2017
Closest in time.
Compiling quantum circuits to realistic hardware architectures using temporal planners
Davide Venturelli, Minh Do, Eleanor Rieffel, and Jeremy Frank · 2018
Closest in time.