Fetching the paper…
Reading the bibliography…
To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware.
On the evolution of random graphs
Erdös, P. and Rényi, A. (1960) · 1960
Earlier work this paper cites.
Toward a scalable, silicon-based quantum computing architecture
Copsey, D., Oskin, M., Impens, F., Metodiev, T., Cross, A., Chong, F. T., Chuang, I. L., and Kubiatowicz, J. (2003) · 2003
Earlier work this paper cites.
Improving the temporal flexibility of position constrained metric temporal plans
Do, M. B. and Kambhampati, S. (2003) · 2003
Earlier work this paper cites.
Planning through stochastic local search and temporal action graphs
Gerevini, A., Saetti, L., and Serina, I. (2003) · 2003
Earlier work this paper cites.
Natural two-qubit gate for quantum computation using the xy interaction
Schuch, N. and Siewert, J. (2003) · 2003
Earlier work this paper cites.
Automated Planning: theory and practice
Ghallab, M., Nau, D., and Traverso, P. (2004) · 2004
Earlier work this paper cites.
Optimal quantum circuits for general two-qubit gates
Vatan, F. and Williams, C. (2004) · 2004
Earlier work this paper cites.
Subgoal partitioning and global search for solving temporal planning problems in mixed space
Wah, B. and Chen, Y. (2004) · 2004
Earlier work this paper cites.
A faster optimal register allocator
Fu, C., Wilken, K., and Goodwin, D. (2005) · 2005
Earlier work this paper cites.
Temporal planning using subgoal partitioning and resolution in sg-plan
Chen, Y. and Wah, B. (2006) · 2006
Earlier work this paper cites.
Branching and pruning: An optimal temporal pocl planner based on constraint programming
Vidal, V. and Geffner, H. (2006) · 2006
Earlier work this paper cites.
The 2008 international planning competition: Deterministic track
Helmert, M., Do, M., and Refanidis, I. (2008) · 2008
Earlier work this paper cites.
Using the context-enhanced additive heuristic for temporal and numeric planning
Eyerich, P., Mattmüller, R., and Röger, G. (2009) · 2009
Earlier work this paper cites.
Forward-chaining partial-order planning
Coles, A. J., Coles, A. I., Fox, M., and Long, D. (2010) · 2010
Earlier work this paper cites.
Planning as satisfiability: Heuristics
Rintanen, J. (2012) · 2012
Earlier work this paper cites.
Efficient distributed quantum computing
Beals, R., Brierley, S., Gray, O., Harrow, A. W., Kutin, S., Linden, N., Shepherd, D., and Stather, M. (2013) · 2013
Earlier work this paper cites.
Wecker, D. and Svore, K. M. (2014) · 2014
Cited alongside, same era.
Exact reordering of circuit lines for nearest neighbor quantum architectures
Wille, R., Lye, A., and Drechsler, R. (2014) · 2014
Cited alongside, same era.
Efficient implementation of quantum circuits with limited qubit interactions
Brierley, S. (2015) · 2015
Cited alongside, same era.
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · 2016
Cited alongside, same era.
Characterizing quantum supremacy in near-term devices
Boxio, S. (2016) · 2016
Cited alongside, same era.
Quantum volume
Bishop, L., Bravyi, S., Cross, A., Gambetta, J., and Smolin, J. (2017) · 2017
Closest in time.
Parametrically-activated entangling gates using transmon qubits
Caldwell, S., Didier, N., Ryan, C., Sete, E., Hudson, A., Karalekas, P., Manenti, R., Reagor, M., da Silva, M., Sinclair, R., et al. (2017) · 2017
Closest in time.
Programming languages and compiler design for realistic quantum hardware
Chong, F. T., Franklin, D., and Martonosi, M. (2017) · 2017
Closest in time.
Open quantum assembly language
Cross, A. W., Bishop, L. S., Smolin, J. A., and Gambetta, J. M. (2017) · 2017
Closest in time.
Quantum algorithms for fixed qubit architectures
Farhi, E., Goldstone, J., Gutmann, S., and Neven, H. (2017) · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., and Shepherd, D. J. (2016) · 2016
Cited alongside, same era.
Performing quantum computing experiments in the cloud
Devitt, S. J. (2016) · 2016
Cited alongside, same era.
Quantum supremacy through the quantum approximate optimization algorithm
Farhi, E. and Harrow, A. W. (2016) · 2016
Cited alongside, same era.
Gate scheduling for quantum algorithms
Guerreschi, G. G. and Park, J. (2016) · 2016
Cited alongside, same era.
A software methodology for compiling quantum programs
Häner, T., Steiger, D. S., Svore, K., and Troyer, M. (2016) · 2016
Cited alongside, same era.
A functional architecture for scalable quantum computing
Sete, E. A., Zeng, W. J., and Rigetti, C. T. (2016) · 2016
Cited alongside, same era.
Scalable quantum circuit and control for a superconducting surface code
Versluis, R., Poletto, S., Khammassi, N., Haider, N., Michalak, D., Bruno, A., Bertels, K., and DiCarlo, L. (2016) · 2016
Cited alongside, same era.
Practical optimization for hybrid quantum-classical algorithms
Guerreschi, G. and Smelyanski, M. (2017) · 2017
Closest in time.
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., and Biswas, R. (2017) · 2017
Closest in time.
The ibm quantum experience
IBM (2017a) · 2017
Closest in time.
A qaoa-inspired circuit for grover’s unstructured search using a transverse field
Jiang, Z., Rieffel, E., and Wang, Z. (2017) · 2017
Closest in time.
A new heuristic for n n -dimensional nearest neighbor realization of a quantum circuit
Kole, A., Datta, K., and Sengupta, I. (2017) · 2017
Closest in time.
Quantum optimization using variational algorithms on near-term quantum devices
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., Kandala, A., Mezzacapo, A., Müller, P., Riess, W., Salis, G., Smolin, J., Tavernelli, I., and Temme, K. (2017) · 2017
Closest in time.
Repository with complementary materials for the reproduction of the tests of the paper (pddl files and instances)
NASA (2017) · 2017
Closest in time.
Design and characterization of a multi-qubit circuit for quantum simulations
Ramasesh, V., O’Brien, K., Dove, A., Kreikebaum, J. M., Colless, J., and Siddiqi, I. (2017) · 2017
Closest in time.
Demonstration of universal parametric entangling gates on a multi-qubit lattice
Reagor, M., Osborn, C., Tezak, N., Staley, A., Prawiroatmodjo, G., Scheer, M., Alidoust, N., Sete, E., Didier, N., da Silva, M., et al. (2017) · 2017
Closest in time.
The Quantum Approximation Optimization Algorithm for MaxCut: A Fermionic View
Wang, Z., Hadfield, S., Jiang, Z., and Rieffel, E. G. (2017) · 2017
Closest in time.