Fetching the paper…
Reading the bibliography…
Quantum computing's transition from theory to reality has spurred the need for novel software tools to manage the increasing complexity, sophistication, toil, and fallibility of quantum algorithm development.
1905
Earlier work this paper cites.
D. Slepian and H. O. Pollak, Prolate spheroidal wave functions, fourier analysis and uncertainty — i, The Bell System Technical Journal 40
1961
Earlier work this paper cites.
F. Harris, On the use of windows for harmonic analysis with the discrete fourier transform, Proceedings of the IEEE 66
1978
Earlier work this paper cites.
J. Kaiser and R. Schafer, On the use of the i0-sinh window for spectrum analysis, IEEE Transactions on Acoustics, Speech, and Signal Processing 28
1980
Earlier work this paper cites.
W. K. Wootters, W. K. Wootters, and W. H. Zurek, A single quantum cannot be cloned, Nature 299
1982
Earlier work this paper cites.
A. S. Holevo and L. E. Ballentine, Probabilistic and statistical aspects of quantum theory, Physics Today 37
1984
Earlier work this paper cites.
P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation 44
1985
Earlier work this paper cites.
P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, in Proceedings 35th Annual Symposium on Foundations of Computer Science (1994) pp. 124–134
1994
Earlier work this paper cites.
A. Y. Kitaev, Quantum measurements and the abelian stabilizer problem (1995), arXiv:quant-ph/9511026 [quant-ph]
1995
Earlier work this paper cites.
B. S. Kaliski, The montgomery inverse and its applications, IEEE Trans. Computers 44
1995
Earlier work this paper cites.
L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996) pp. 212–219
1996
Earlier work this paper cites.
A. Barenco, A. Ekert, K.-A. Suominen, and P. Törmä, Approximate quantum fourier transform and decoherence, Physical Review A 54
1996
Earlier work this paper cites.
A. Luis and J. Peřina, Optimum phase-shift estimation and the quantum description of the phase difference, Physical Review A 54
1996
Earlier work this paper cites.
E. Bernstein and U. Vazirani, Quantum complexity theory, SIAM Journal on Computing 26
1997
Earlier work this paper cites.
R. Cleve, A. Ekert, C. Macchiavello, and M. Mosca, Quantum algorithms revisited, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences 454
1998
Earlier work this paper cites.
C. Zalka, Fast versions of shor’s quantum factoring algorithm, arXiv: Quantum Physics (1998)
1998
Earlier work this paper cites.
A. Pati and S. Braunstein, Impossibility of deleting an unknown quantum state, Nature 404
2000
Earlier work this paper cites.
J. Ellson, E. Gansner, L. Koutsofios, S. C. North, and G. Woodhull, Graphviz— open source graph drawing tools, in Graph Drawing , edited by P. Mutzel, M. Jünger, and S. Leipert (Springer Berlin Heidelberg, Berlin, Heidelberg, 2002) pp. 483–484
2002
Earlier work this paper cites.
A. Y. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and quantum computation, in Graduate Studies in Mathematics (2002)
2002
Earlier work this paper cites.
L. Grover and T. Rudolph, Creating superpositions that correspond to efficiently integrable probability distributions (2002), arXiv:quant-ph/0208112 [quant-ph]
2002
Earlier work this paper cites.
J. Proos and C. Zalka, Shor’s discrete logarithm quantum algorithm for elliptic curves, Quantum Inf. Comput. 3
2003
Earlier work this paper cites.
M. Mottonen, J. J. Vartiainen, V. Bergholm, and M. M. Salomaa, Transformation of quantum states using uniformly controlled rotations (2004), arXiv:quant-ph/0407010 [quant-ph]
2004
Earlier work this paper cites.
V. Shende, S. Bullock, and I. Markov, Synthesis of quantum-logic circuits, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25
2006
Earlier work this paper cites.
A. Ambainis, Quantum walk algorithm for element distinctness, SIAM Journal on Computing 37
2007
Earlier work this paper cites.
B. L. Higgins, D. W. Berry, S. D. Bartlett, H. M. Wiseman, and G. J. Pryde, Entanglement-free heisenberg-limited phase estimation, Nature 450
2007
Earlier work this paper cites.
A. Hagberg, P. Swart, and D. S Chult, Exploring network structure, dynamics, and function using NetworkX , Tech. Rep. (Los Alamos National Lab.(LANL), Los Alamos, NM (United States), 2008)
2008
Earlier work this paper cites.
V. Giovannetti, S. Lloyd, and L. Maccone, Architectures for a quantum random access memory, Physical Review A 78
2008
Earlier work this paper cites.
C. R. Clark, T. S. Metodi, S. D. Gasster, and K. R. Brown, Resource requirements for fault-tolerant quantum simulation: The ground state of the transverse ising model, Phys. Rev. A 79
2009
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Physical Review Letters 103
2009
Earlier work this paper cites.
H. Imai and M. Hayashi, Fourier analytic approach to phase estimation in quantum systems, New Journal of Physics 11
2009
Earlier work this paper cites.
D. W. Berry, B. L. Higgins, S. D. Bartlett, M. W. Mitchell, G. J. Pryde, and H. M. Wiseman, How to perform the most accurate possible phase measurements, Physical Review A 80
2009
Earlier work this paper cites.
A. G. Fowler, Constructing arbitrary steane code single logical qubit fault-tolerant gates (2010), arXiv:quant-ph/0411206 [quant-ph]
2010
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2010)
2010
Earlier work this paper cites.
C. Horsman, A. G. Fowler, S. J. Devitt, and R. V. Meter, Surface code quantum computing by lattice surgery, New Journal of Physics 14
2011
Earlier work this paper cites.
2012
Earlier work this paper cites.
A. S. Green, P. L. Lumsdaine, N. J. Ross, P. Selinger, and B. Valiron, Quipper: a scalable quantum programming language, in Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation (2013) pp. 333–342
2013
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 45
2015
Cited alongside, same era.
T. Developers, TensorFlow: Large-scale machine learning on heterogeneous systems (2015), software available from tensorflow.org
2015
Cited alongside, same era.
A. Bocharov, M. Roetteler, and K. M. Svore, Efficient synthesis of universal repeat-until-success quantum circuits, Physical Review Letters 114
2015
Cited alongside, same era.
J. M. Martyn, Z. M. Rossi, A. K. Tan, and I. L. Chuang, Grand unification of quantum algorithms, PRX Quantum 2
2021
Later among the works it cites.
E. T. Campbell, Early fault-tolerant simulations of the hubbard model, Quantum Science and Technology 7
2021
Later among the works it cites.
C. Gidney and M. Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5
2021
Later among the works it cites.
T. E. O’Brien, M. Streif, N. C. Rubin, R. Santagati, Y. Su, W. J. Huggins, J. J. Goings, N. Moll, E. Kyoseva, M. Degroote, C. S. Tautermann, J. Lee, D. W. Berry, N. Wiebe, and R. Babbush, Efficient quantum computation of molecular forces and other energy gradients, Physical Review Research 4
2022
Later among the works it cites.
C. Yuan and M. Carbin, Tower: Data structures in quantum superposition, Proceedings of the ACM on Programming Languages 6
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
2016
Cited alongside, same era.
T. G. Draper and S. A. Kutin, qpic: Quantum circuit diagrams in latex, https://github.com/qpic/qpic (2016)
2016
Cited alongside, same era.
2016
Cited alongside, same era.
I. Kerenidis and A. Prakash, Quantum recommendation systems (2016), arXiv:1603.08675 [quant-ph]
2016
Cited alongside, same era.
J. Paykin, R. Rand, and S. Zdancewic, Qwire: a core language for quantum circuits, in ACM SIGPLAN Symposium on Principles of Programming Languages , Vol. 52 (Association for Computing Machinery, New York, NY, USA, 2017) p. 846–858
2017
Cited alongside, same era.
S. Developers, Sympy: symbolic computing in python, PeerJ Computer Science 3
2017
Cited alongside, same era.
M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, and M. Troyer, Elucidating reaction mechanisms on quantum computers, Proceedings of the national academy of sciences 114
2017
Cited alongside, same era.
2022
Later among the works it cites.
M. Paltenghi and M. Pradel, Bugs in quantum computing platforms: an empirical study, Proc. ACM Program. Lang. 6
2022
Later among the works it cites.
2022
Later among the works it cites.
P. C. Costa, D. An, Y. R. Sanders, Y. Su, R. Babbush, and D. W. Berry, Optimal scaling quantum linear-systems solver via discrete adiabatic theorem, PRX Quantum 3
2022
Later among the works it cites.
Y. Xiong, S. X. Ng, G.-L. Long, and L. Hanzo, Dual-frequency quantum phase estimation mitigates the spectral leakage of quantum algorithms, IEEE Signal Processing Letters 29
2022
Later among the works it cites.
G. Rendon, T. Izubuchi, and Y. Kikuchi, Effects of cosine tapering window on quantum phase estimation, Physical Review D 106
2022
Later among the works it cites.
2023
Later among the works it cites.
M. S. Zini, A. Delgado, R. dos Reis, P. A. M. Casares, J. E. Mueller, A.-C. Voigt, and J. M. Arrazola, Quantum simulation of battery materials using ionic pseudopotentials, Quantum 7
2023
Later among the works it cites.
2023
Later among the works it cites.
Cirq Developers, Cirq (2023)
2023
Later among the works it cites.
Qiskit contributors, Qiskit: An open-source framework for quantum computing (2023)
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
2023
Later among the works it cites.
É. Gouzien, D. Ruiz, F.-M. L. Régent, J. Guillaud, and N. Sangouard, Performance analysis of a repetition cat code architecture: Computing 256-bit elliptic curve logarithm in 9 hours with 126133 cat qubits., Physical review letters 131 4
2023
Later among the works it cites.
2023
Later among the works it cites.
Quantum algorithm zoo, https://quantumalgorithmzoo.org/ , accessed: 2024-08-15
2024
Closest in time.
N. C. Rubin, D. W. Berry, A. Kononov, F. D. Malone, T. Khattar, A. White, J. Lee, H. Neven, R. Babbush, and A. D. Baczewski, Quantum computation of stopping power for inertial fusion target design, Proceedings of the National Academy of Sciences 121
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
G. H. Low, V. Kliuchnikov, and L. Schaeffer, Trading t gates for dirty qubits in state preparation and unitary synthesis, Quantum 8
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
D. Motlagh and N. Wiebe, Generalized quantum signal processing (2024), arXiv:2308.01501 [quant-ph]
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
D. W. Berry, Y. Su, C. Gyurik, R. King, J. Basso, A. D. T. Barba, A. Rajput, N. Wiebe, V. Dunjko, and R. Babbush, Analyzing prospects for quantum advantage in topological data analysis, PRX Quantum 5
2024
Closest in time.