Fetching the paper…
Reading the bibliography…
A widely-used quantum programming paradigm comprises of both the data flow and control flow.
M. J. Flynn, “Some computer organizations and their effectiveness,” IEEE transactions on computers , vol. 100, pp. 948–960, 1972
1972
Earlier work this paper cites.
R. P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics , vol. 21, pp. 467–488, 1982
1982
Earlier work this paper cites.
C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. K. Wootters, “Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels,” Physical Review Letters , vol. 70, p. 1895, 1993
1993
Earlier work this paper cites.
D. Deutsch, A. Barenco, and A. Ekert, “Universality in quantum computation,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 449, pp. 669–677, 1995
1995
Earlier work this paper cites.
S. Lloyd, “Almost any quantum logic gate is universal,” Physical Review Letters , vol. 75, p. 346, 1995
1995
Earlier work this paper cites.
A. Y. Kitaev, “Quantum measurements and the Abelian stabilizer problem,” in Electronic Colloquium on Computational Complexity , 1996
1996
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” in Proceedings of the 28th Annual ACM Symposium on Theory of Computing . ACM, 1996, pp. 212–219
1996
Earlier work this paper cites.
D. P. DiVincenzo, “Quantum gates and circuits,” Proceedings of the Royal Society of London A: Mathematical, Physical and Engineering Sciences , vol. 454, pp. 261–276, 1998
1998
Earlier work this paper cites.
S. Vassiliadis, S. Wong, and S. Cotofana, “Microcode processing: Positioning and directions,” IEEE Micro , vol. 23, pp. 21–30, 2003
2003
Earlier work this paper cites.
P. Selinger, “Towards a quantum programming language,” Mathematical Structures in Computer Science , vol. 14, pp. 527–586, 2004
2004
Earlier work this paper cites.
S. Balensiefer, L. Kregor-Stickles, and M. Oskin, “An evaluation framework and instruction set architecture for ion-trap based quantum micro-architectures,” in Proceedings of 32nd International Symposium on Computer Architecture . IEEE, 2005, pp. 186–196
2005
Earlier work this paper cites.
J. Werschnik and E. Gross, “Quantum optimal control theory,” Journal of Physics B: Atomic, Molecular and Optical Physics , vol. 40, p. R175, 2007
2007
Earlier work this paper cites.
E. A. Lee, “Computing needs time,” Communications of the ACM , vol. 52, pp. 70–79, 2009
2009
Earlier work this paper cites.
L. DiCarlo, J. M. Chow, J. M. Gambetta, L. S. Bishop, B. R. Johnson, D. I. Schuster, J. Majer, A. Blais, L. Frunzio, S. M. Girvin, and R. J. Schoelkopf, “Demonstration of two-qubit algorithms with a superconducting quantum processor,” Nature , vol. 460, pp. 240–244, 2009
2009
Earlier work this paper cites.
J. E. Stone, D. Gohara, and G. Shi, “OpenCL: A parallel programming standard for heterogeneous computing systems,” Computing in Science & Engineering , vol. 12, pp. 66–73, 2010
2010
Earlier work this paper cites.
I. Kassal, J. D. Whitfield, A. Perdomo-Ortiz, M.-H. Yung, and A. Aspuru-Guzik, “Simulating chemistry using quantum computers,” Annual Review of Physical Chemistry , vol. 62, pp. 185–207, 2011
2011
Earlier work this paper cites.
E. Magesan, J. M. Gambetta, and J. Emerson, “Scalable and robust randomized benchmarking of quantum processes,” Physical Review Letters , vol. 106, p. 180504, 2011
2011
Earlier work this paper cites.
D. Ristè, C. C. Bultink, K. W. Lehnert, and L. DiCarlo, “Feedback control of a solid-state qubit using high-fidelity projective measurement,” Physical Review Letters , vol. 109, p. 240502, 2012
2012
Earlier work this paper cites.
A. J. Abhari, A. Faruque, M. J. Dousti, L. Svec, O. Catu, A. Chakrabati, C.-F. Chiang, S. Vanderwilt, J. Black, and F. Chong, “Scaffold: Quantum programming language,” Princeton University, Technical Report, 2012
2012
Earlier work this paper cites.
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, “Surface codes: Towards practical large-scale quantum computation,” Physical Review A , vol. 86, p. 032324, 2012
2012
Cited alongside, same era.
D. Kudrow, K. Bier, Z. Deng, D. Franklin, Y. Tomita, K. R. Brown, and F. T. Chong, “Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers,” in ACM SIGARCH Computer Architecture News . ACM, 2013, pp. 166–176
2013
Cited alongside, same era.
M. D. Reed, “Entanglement and quantum error correction with superconducting qubits,” Ph.D. dissertation, Yale University, 2013
2013
Cited alongside, same era.
A. Paetznick and K. M. Svore, “Repeat-Until-Success: Non-deterministic decomposition of single-qubit unitaries,” Quantum Information & Computation , vol. 14, pp. 1277–1301, 2014
2014
Cited alongside, same era.
F. T. Chong, D. Franklin, and M. Martonosi, “Programming languages and compiler design for realistic quantum hardware,” Nature , vol. 549, p. 180, 2017
2017
Later among the works it cites.
S. S. Tannu, Z. A. Myers, P. J. Nair, D. M. Carmean, and M. K. Qureshi, “Taming the instruction bandwidth of quantum computers via hardware-managed error correction,” in Proceedings of the 50th Annual IEEE/ACM International Symposium on Microarchitecture . IEEE/ACM, 2017, pp. 679–691
2017
Later among the works it cites.
2017
Later among the works it cites.
N. Leung, M. Abdelhafez, J. Koch, and D. Schuster, “Speedup for quantum optimal control from automatic differentiation based on graphics processing units,” Physical Review A , vol. 95, p. 042318, 2017
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
J. M. Epstein, A. W. Cross, E. Magesan, and J. M. Gambetta, “Investigating the limits of randomized benchmarking protocols,” Physical Review A , vol. 89, p. 062321, 2014
2014
Cited alongside, same era.
B. M. Terhal, “Quantum error correction for quantum memories,” Reviews of Modern Physics , vol. 87, p. 307, 2015
2015
Cited alongside, same era.
A. JavadiAbhari, S. Patil, D. Kudrow, J. Heckey, A. Lvov, F. T. Chong, and M. Martonosi, “ScaffCC: Scalable compilation and analysis of quantum programs,” Parallel Computing , vol. 45, pp. 2–17, 2015
2015
Cited alongside, same era.
J. Heckey, S. Patil, A. JavadiAbhari, A. Holmes, D. Kudrow, K. R. Brown, D. Franklin, F. T. Chong, and M. Martonosi, “Compiler management of communication and parallelism for quantum computation,” in Proceedings of 20th ACM International Conference on Architectural Support for Programming Languages and Operating Systems . ACM, 2015, pp. 445–456
2015
Cited alongside, same era.
2016
Cited alongside, same era.
M. Ying, Foundations of Quantum Programming . Morgan Kaufmann, 2016
2016
Cited alongside, same era.
C. C. Bultink, M. A. Rol, T. E. O’Brien, X. Fu, B. Dikken, R. Vermeulen, J. C. de Sterke, A. Bruno, R. N. Schouten, and L. DiCarlo, “Active resonator reset in the nonlinear dispersive regime of circuit QED,” Physical Review Applied , vol. 6, p. 034008, 2016
2016
Cited alongside, same era.
R. Versluis, S. Poletto, N. Khammassi, B. Tarasinski, N. Haider, D. J. Michalak, A. Bruno, K. Bertels, and L. DiCarlo, “Scalable quantum circuit and control for a superconducting surface code,” Physical Review Applied , vol. 8, p. 034021, 2017
2017
Later among the works it cites.
L. Riesebos, X. Fu, S. Varsamopoulos, C. G. Almudever, and K. Bertels, “Pauli frames for quantum computer architectures,” in Proceedings of the 54th Annual Design Automation Conference . ACM, 2017, p. 76
2017
Later among the works it cites.
J. Preskill, “Quantum computing in the NISQ era and beyond,” arXiv:1801.00862 , 2018
2018
Closest in time.
D. S. Steiger, T. Häner, and M. Troyer, “ProjectQ: an open source software framework for quantum computing,” Quantum , vol. 2, 2018
2018
Closest in time.
IBM Q team, “IBM Quantum Experience,” https://www.research.ibm.com/ibm-q/ , 2018
2018
Closest in time.
Rigetti, “Rigetti Forest,” https://www.rigetti.com/forest , 2018
2018
Closest in time.
Alibaba, “Alibaba Quantum Computing Cloud,” http://quantumcomputer.ac.cn , 2018
2018
Closest in time.
2018
Closest in time.
X. Fu, M. A. Rol, C. C. Bultink, J. van Someren, N. Khammassi, I. Ashraf, R. F. L. Vermeulen, J. C. de Sterke, W. J. Vlothuizen, R. N. Schouten, C. G. Almudever, L. DiCarlo, and K. Bertels, “A microarchitecture for a superconducting quantum processor,” IEEE Micro , vol. 38, pp. 40–47, 2018
2018
Closest in time.
2018
Closest in time.
K. Svore, A. Geller, M. Troyer, J. Azariah, C. Granade, B. Heim, V. Kliuchnikov, M. Mykhailova, A. Paz, and M. Roetteler, “Q#: Enabling scalable quantum computing and development with a high-level DSL,” in Proceedings of the Real World Domain Specific Languages Workshop 2018 . ACM, 2018, p. 7
2018
Closest in time.
2018
Closest in time.
5 5 -qubit backend: IBM Q team, “IBM Q 5 Yorktown backend specification V1.1.0,” Retrieved from https://github.com/QISKit/qiskit-backend-information/tree/master/backends/yorktown/V1 , 2018
2018
Closest in time.
2018
Closest in time.
T. F. Watson, S. G. J. Philips, E. Kawakami, D. R. Ward, P. Scarlino, M. Veldhorst, D. E. Savage, M. G. Lagally, M. Friesen, S. N. Coppersmith, M. A. Eriksson, and L. M. K. Vandersypen, “A programmable two-qubit quantum processor in silicon,” Nature , vol. 555, p. 633, 2018
2018
Closest in time.