Fetching the paper…
Reading the bibliography…
Operating on the principles of quantum mechanics, quantum algorithms hold the promise for solving problems that are beyond the reach of the best-available classical algorithms.
One-level storage system
Tom Kilburn, David BG Edwards, Michael J Lanigan, and Frank H Sumner. 1962 · 1962
Earlier work this paper cites.
The tree machine: A highly concurrent computing environment
Sally Anne Browning. 1980 · 1980
Earlier work this paper cites.
Going beyond Bell’s theorem
Daniel M Greenberger, Michael A Horne, and Anton Zeilinger. 1989 · 1989
Earlier work this paper cites.
Optimal embedding of complete binary trees into lines and grids. In Proc. 17th Int. Workshop on Graph-Theoretic Concepts in Computer Science (WG’91), Lecture Notes in Computer Science . 25–35
Ralf Heckmann, Ralf Klasing, Burkhard Monien, and Walter Unger. 1992 · 1992
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings 35th annual symposium on foundations of computer science . Ieee, 124–134
Peter W Shor. 1994 · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search. In Proceedings of the twenty-eighth annual ACM symposium on Theory of computing . 212–219
Lov K Grover. 1996 · 1996
Earlier work this paper cites.
Microelectronic circuit design
Richard C Jaeger, Travis N Blalock, and Benjamin Joseph Blalock. 1997 · 1997
Earlier work this paper cites.
Quantum repeaters: the role of imperfect local operations in quantum communication
H-J Briegel, Wolfgang Dür, Juan I Cirac, and Peter Zoller. 1998 · 1998
Earlier work this paper cites.
Implementing image analysis with a graph-based parallel computing model
Bertrand Ducourthial, G Constantinescu, and Alain Mérigot. 1998 · 1998
Earlier work this paper cites.
Experimental entanglement swapping: entangling photons that never interacted
Jian-Wei Pan, Dik Bouwmeester, Harald Weinfurter, and Anton Zeilinger. 1998 · 1998
Earlier work this paper cites.
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
Jaroslav Opatrny and Dominique Sotteau. 2000 · 2000
Earlier work this paper cites.
Quantum compiling
Aram Harrow. 2001 · 2001
Earlier work this paper cites.
Bell’s theorem with and without inequalities for the three-qubit Greenberger-Horne-Zeilinger and W states
Adán Cabello. 2002 · 2002
Earlier work this paper cites.
Quantum computation and quantum information
Michael A Nielsen and Isaac Chuang. 2002 · 2002
Earlier work this paper cites.
Expansion of layouts of complete binary trees into grids
Y-B Lin, Zevi Miller, Manley Perkel, Dan Pritikin, and Ivan Hal Sudborough. 2003 · 2003
Earlier work this paper cites.
Optimal quantum circuit synthesis from controlled-unitary gates
Jun Zhang, Jiri Vala, Shankar Sastry, and K Birgitta Whaley. 2004 · 2004
Earlier work this paper cites.
Data structures and algorithms for simplifying reversible circuits
Aditya K Prasad, Vivek V Shende, Igor L Markov, John P Hayes, and Ketan N Patel. 2006 · 2006
Earlier work this paper cites.
Architectures for a quantum random access memory
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. 2008a · 2008
Earlier work this paper cites.
Quantum random access memory
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone. 2008b · 2008
Earlier work this paper cites.
Quantum circuit placement
Dmitri Maslov, Sean M Falconer, and Michele Mosca. 2008 · 2008
Earlier work this paper cites.
Impossibility of a quantum speed-up with a faulty oracle. In Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I 35 . Springer, 773–781
Oded Regev and Liron Schiff. 2008 · 2008
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd. 2009 · 2009
Cited alongside, same era.
Surface code quantum computing by lattice surgery
Clare Horsman, Austin G Fowler, Simon Devitt, and Rodney Van Meter. 2012 · 2012
Cited alongside, same era.
Polynomial-time T-depth optimization of Clifford+ T circuits via matroid partitioning
Matthew Amy, Dmitri Maslov, and Michele Mosca. 2014 · 2014
Cited alongside, same era.
Quantum networking
Rodney Van Meter. 2014 · 2014
Cited alongside, same era.
Quantum machine learning
Quantum computer systems: Research for noisy intermediate-scale quantum computers
Yongshan Ding and Frederic T Chong. 2020 · 2020
Later among the works it cites.
Systematic crosstalk mitigation for superconducting qubits via frequency-aware compilation. In 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 201–214
Yongshan Ding, Pranav Gokhale, Sophia Fuhui Lin, Richard Rines, Thomas Propson, and Frederic T Chong. 2020a · 2020
Later among the works it cites.
Square: Strategic quantum ancilla reuse for modular quantum programs via cost-effective uncomputation. In 2020 ACM/IEEE 47th Annual International Symposium on Computer Architecture (ISCA) . IEEE, 570–583
Yongshan Ding, Xin-Chuan Wu, Adam Holmes, Ash Wiseth, Diana Franklin, Margaret Martonosi, and Frederic T Chong. 2020b · 2020
Later among the works it cites.
Convex optimization using quantum oracles
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf. 2020 · 2020
Later among the works it cites.
The XZZX surface code
J Pablo Bonilla Ataides, David K Tuckett, Stephen D Bartlett, Steven T Flammia, and Benjamin J Brown. 2021 · 2021
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jacob Biamonte, Peter Wittek, Nicola Pancotti, Patrick Rebentrost, Nathan Wiebe, and Seth Lloyd. 2017 · 2017
Cited alongside, same era.
Programming languages and compiler design for realistic quantum hardware
Frederic T Chong, Diana Franklin, and Margaret Martonosi. 2017 · 2017
Cited alongside, same era.
Optimal Hamiltonian simulation by quantum signal processing
Guang Hao Low and Isaac L Chuang. 2017 · 2017
Cited alongside, same era.
Encoding electronic spectra in quantum circuits with linear T complexity
Ryan Babbush, Craig Gidney, Dominic W Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven. 2018 · 2018
Cited alongside, same era.
Halving the cost of quantum addition
Craig Gidney. 2018 · 2018
Cited alongside, same era.
Trading T-gates for dirty qubits in state preparation and unitary synthesis
Guang Hao Low, Vadym Kliuchnikov, and Luke Schaeffer. 2018 · 2018
Cited alongside, same era.
Quantum computing in the NISQ era and beyond
John Preskill. 2018 · 2018
Cited alongside, same era.
Later among the works it cites.
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Craig Gidney and Martin Ekerå. 2021 · 2021
Later among the works it cites.
Practicality of Quantum Random Access Memory
Connor T Hann. 2021 · 2021
Later among the works it cites.
Resilience of quantum random access memory to generic noise
Connor T Hann, Gideon Lee, SM Girvin, and Liang Jiang. 2021 · 2021
Later among the works it cites.
Exploiting quantum teleportation in quantum circuit mapping. In Proceedings of the 26th Asia and South Pacific Design Automation Conference . 792–797
Stefan Hillmich, Alwin Zulehner, and Robert Wille. 2021 · 2021
Later among the works it cites.
Tilt: Achieving higher fidelity on a trapped-ion linear-tape quantum computing architecture. In 2021 IEEE International Symposium on High-Performance Computer Architecture (HPCA) . IEEE, 153–166
Xin-Chuan Wu, Dripto M Debroy, Yongshan Ding, Jonathan M Baker, Yuri Alexeev, Kenneth R Brown, and Frederic T Chong. 2021 · 2021
Later among the works it cites.
Time-optimal qubit mapping. In Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems . 360–374
Chi Zhang, Ari B Hayes, Longfei Qiu, Yuwei Jin, Yanhao Chen, and Eddy Z Zhang. 2021 · 2021
Later among the works it cites.
T-count and T-depth of any multi-qubit unitary
Vlad Gheorghiu, Michele Mosca, and Priyanka Mukhopadhyay. 2022 · 2022
Later among the works it cites.
Qubit Mapping and Routing via MaxSAT. In 2022 55th IEEE/ACM International Symposium on Microarchitecture (MICRO) . IEEE, 1078–1091
Abtin Molavi, Amanda Xu, Martin Diges, Lauren Pick, Swamit Tannu, and Aws Albarghouthi. 2022 · 2022
Later among the works it cites.
Approximate Quantum Random Access Memory Architectures
Koustubh Phalak, Junde Li, and Swaroop Ghosh. 2022 · 2022
Later among the works it cites.
Quantum Computing: Progress and Innovation
Gregory T Byrd and Yongshan Ding. 2023 · 2023
Closest in time.
Zhao-Yun Chen, Cheng Xue, Tai-Ping Sun, Huan-Yu Liu, Xi-Ning Zhuang, Meng-Han Dou, Tian-Rui Zou, Yuan Fang, Yu-Chun Wu, and Guo-Ping Guo. 2023 · 2023
Closest in time.
Samuel Jaques and Arthur G Rattew. 2023 · 2023
Closest in time.
Implementation of a Quantum Switch with Superconducting Circuits
Connie Miao, Gideon Lee, Liang Jiang, and David Schuster. 2023 · 2023
Closest in time.
Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis
Xiaoming Sun, Guojing Tian, Shuai Yang, Pei Yuan, and Shengyu Zhang. 2023 · 2023
Closest in time.
A hybrid controlled-SWAP gate between two bosonic modes
Sophia Xue, Stijn de Graaf, Benjamin Chapman, Yaxing Zhang, James Teoh, Jacob Curtis, Takahiro Tsunoda, Alec Eickbusch, Alexander Read, Akshay Koottandavida, et al · 2023
Closest in time.