Fetching the paper…
Reading the bibliography…
In recent decades, the field of quantum computing has experienced remarkable progress.
R. F. Shaw, “Arithmetic operations in a binary computer,” Review of scientific instruments
1950
Earlier work this paper cites.
G. B. Rosenberger, “Simultaneous carry adder,” US Patent 2,966
1957
Earlier work this paper cites.
J. Sklansky, “Conditional-sum addition logic,” Electronic Computers, IRE Transactions on
1960
Earlier work this paper cites.
A. A. Karatsuba and Y. P. Ofman, “Multiplication of many-digital numbers by automatic computers,” in Doklady Akademii Nauk
1962
Earlier work this paper cites.
C. S. Wallace, “A suggestion for a fast multiplier,” IEEE Transactions on electronic Computers
1964
Earlier work this paper cites.
PhD thesis, Massachusetts Institute of Technology, 1964
R. E. Goldschmidt, Applications of division by convergence · 1964
Earlier work this paper cites.
US Patent 3,340,388
J. G. Earle, “Latched carry save adder circuit for multipliers,” Sept. 5 1967 · 1967
Earlier work this paper cites.
S. A. Cook and S. O. Aanderaa, “On the minimum computation time of functions,” Transactions of the American Mathematical Society
1969
Earlier work this paper cites.
A. Schönhage and V. Strassen, “Fast multiplication of large numbers,” Computing
1971
Earlier work this paper cites.
C. H. Bennett, “Logical reversibility of computation,” Ibm Journal of Research and Development
1973
Earlier work this paper cites.
F. Black and M. Scholes, “The pricing of options and corporate liabilities,” Journal of Political Economy
1973
Earlier work this paper cites.
R. C. Merton, “Theory of rational option pricing,” The Bell Journal of Economics and Management Science
1973
Earlier work this paper cites.
V. Vedral, A. Barenco, and A. Ekert, “Quantum networks for elementary arithmetic operations,” Physical Review A
1995
Earlier work this paper cites.
Elsevier, 1995
S. C. Kak, Quantum Neural Computing · 1995
Earlier work this paper cites.
P. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” Proceedings of 35th Annual Symposium on Foundations of Computer Science
1996
Earlier work this paper cites.
V. Vedral, A. Barenco, and A. Ekert, “Quantum networks for elementary arithmetic operations,” Physical Review A
1996
Earlier work this paper cites.
D. Beckman, A. N. Chari, S. Devabhaktuni, and J. Preskill, “Efficient networks for quantum factoring,” Physical Review A
1996
Earlier work this paper cites.
R. B. Griffiths and C.-S. Niu, “Semiclassical fourier transform for quantum computation,” Physical Review Letters
1996
Earlier work this paper cites.
P. Gossett, “Quantum carry-save arithmetic,” 1998
1998
Earlier work this paper cites.
C. Zalka, “Fast versions of shor’s quantum factoring algorithm,” arXiv preprint quant-ph/9806084
1998
Earlier work this paper cites.
D. Harris, S. Oberman, and M. Horowitz, “Srt division: Architectures, models, and implementations,” Computer Systems Library, Standard University, Tech. Rep
1998
Earlier work this paper cites.
T. G. Draper, “Addition on a quantum computer,” 2000
2000
Earlier work this paper cites.
R. Cleve and J. Watrous, “Fast parallel circuits for the quantum fourier transform,” in Proceedings 41st Annual Symposium on Foundations of Computer Science
2000
Earlier work this paper cites.
S. Gupta and R. Zia, “Quantum neural networks,” Journal of Computer and System Sciences
2001
Earlier work this paper cites.
S. Beauregard, “Circuit for shor’s algorithm using 2n+3 qubits,” 2002
2002
Earlier work this paper cites.
K.-W. Cheng and C.-C. Tseng, “Quantum full adder and subtractor,” Electronics Letters
2002
Earlier work this paper cites.
S. A. Cuccaro, T. G. Draper, S. A. Kutin, and D. P. Moulton, “A new quantum ripple-carry addition circuit,” 2004
2004
Earlier work this paper cites.
T. Draper, S. Kutin, E. Rains, and K. Svore, “A logarithmic-depth quantum carry-lookahead adder,” Quantum Information and Computation
2004
Earlier work this paper cites.
A. Q. Nguyen, “Tr-2004007: Optimal reversible quantum circuit for multiplication,” 2004
2004
Earlier work this paper cites.
A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg, “Implementation of shor’s algorithm on a linear nearest neighbour qubit array,” 2004
2004
Earlier work this paper cites.
Y. Takahashi and N. Kunihiro, “A linear-size quantum circuit for addition with no ancillary qubits,” Quantum Info. Comput
2005
Earlier work this paper cites.
R. Van Meter and K. M. Itoh, “Fast quantum modular exponentiation,” Physical Review A
2005
Earlier work this paper cites.
Y. Takahashi and N. Kunihiro, “A fast quantum circuit for addition with few qubits,” Quantum Information and Computation
2008
Earlier work this paper cites.
Y. Takahashi, “Quantum arithmetic circuits: a survey,” IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
2009
Earlier work this paper cites.
Y. Takahashi, S. Tani, and N. Kunihiro, “Quantum addition circuits and unbounded fan-out,” Quantum Information and Computation
2009
Earlier work this paper cites.
H. Thapliyal and N. Ranganathan, “Design of efficient reversible binary subtractors based on a new reversible gate,” in 2009 IEEE computer society annual symposium on VLSI
2009
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical Review Letters
2009
Earlier work this paper cites.
M. M. Wilde, “Quantum-shift-register circuits,” Physical Review A
2009
Earlier work this paper cites.
X. Fu, W. Bao, and C. Zhou, “Speeding up implementation for shor’s factorization quantum algorithm,” Chinese Science Bulletin
2010
Earlier work this paper cites.
D. Maslov, “Reversible logic synthesis benchmarks page.” http://webhome.cs.uvic.ca/~dmaslov/ , 2011
2011
Earlier work this paper cites.
A. Khosropour, H. Aghababa, and B. Forouzandeh, “Quantum division circuit based on restoring division algorithm,” in 2011 Eighth International Conference on Information Technology: New Generations
2011
Earlier work this paper cites.
Cambridge University Press, June 2012
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information: 10th Anniversary Edition · 2012
Earlier work this paper cites.
A. Pavlidis and D. Gizopoulos, “Fast quantum modular exponentiation architecture for shor’s factorization algorithm,” 2012
2012
Earlier work this paper cites.
2012
Earlier work this paper cites.
T. Nguyen and R. Van Meter, “A space-efficient design for reversible floating point adder in quantum computing,” ACM Journal on Emerging Technologies in Computing Systems
2013
Earlier work this paper cites.
J. A. Smolin, G. Smith, and A. Vargo, “Oversimplifying quantum factoring,” Nature
2013
Earlier work this paper cites.
C.-C. Lin, A. Chakrabarti, and N. K. Jha, “Qlib: Quantum module library,” ACM Journal on Emerging Technologies in Computing Systems (JETC)
2014
Earlier work this paper cites.
C. M. Maynard and E. Pius, “A quantum multiply-accumulator,” Quantum information processing
2014
Earlier work this paper cites.
J. Jain and R. Agrawal, “Design and development of efficient reversible floating point arithmetic unit,” pp. 811–815, 04 2015
2015
Earlier work this paper cites.
S. Kepley and R. Steinwandt, “Quantum circuits for f _ 2ˆ n f 2 n-multiplication with subquadratic gate count,” Quantum Information Processing
2015
Earlier work this paper cites.
F. Wang, M. Luo, H. Li, Z. Qu, and X. Wang, “Improved quantum ripple-carry addition circuit,” Science China Information Sciences
2016
Earlier work this paper cites.
H. Thapliyal, “Mapping of subtractor and adder-subtractor circuits on reversible quantum gates,” in Transactions on Computational Science XXVII
2016
Earlier work this paper cites.
H. Jayashree, H. Thapliyal, H. R. Arabnia, and V. K. Agrawal, “Ancilla-input and garbage-output optimized design of a reversible quantum integer multiplier,” The Journal of Supercomputing
2016
Cited alongside, same era.
L. Ruiz-Perez and J. C. Garcia-Escartin, “Quantum arithmetic with the quantum fourier transform,” Quantum Information Processing
2017
Cited alongside, same era.
2017
Cited alongside, same era.
A. AnanthaLakshmi and G. F. Sudha, “A novel power efficient 0.64-gflops fused 32-bit reversible floating point arithmetic unit architecture for digital signal processing applications,” Microprocessors and Microsystems
2017
Cited alongside, same era.
R. Seidel, N. Tcholtchev, S. Bock, C. K.-U. Becker, and M. Hauswirth, “Efficient floating point arithmetic for quantum computers,” IEEE Access
2022
Later among the works it cites.
A. Paler, “Quantum fourier addition simplified to toffoli addition,” Physical Review A
2022
Later among the works it cites.
B. Park and A. Doyeol, “T count optimization of approximate quantum fourier transform,” 2022
2022
Later among the works it cites.
S. Sajadimanesh, J. P. L. Faye, and E. Atoofian, “Practical approximate quantum multipliers for nisq devices,” in Proceedings of the 19th ACM International Conference on Computing Frontiers
2022
Later among the works it cites.
S. Gayathri, R. Kumar, and S. Dhanalakshmi, “Efficient floating-point division quantum circuit using newton-raphson division,” in Journal of Physics: Conference Series
2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2017
Cited alongside, same era.
G. H. Low and I. L. Chuang, “Optimal hamiltonian simulation by quantum signal processing,” Physical Review Letters
2017
Cited alongside, same era.
T. Häner, M. Soeken, M. Roetteler, and K. Svore, “Quantum circuits for floating-point arithmetic,” 07 2018
2018
Cited alongside, same era.
T. Kim and B.-S. Choi, “Efficient decomposition methods for controlled-rn using a single ancillary qubit,” Scientific Reports
2018
Cited alongside, same era.
C. Gidney, “Halving the cost of quantum addition,” Quantum
2018
Cited alongside, same era.
S. Dutta, D. Bhattacharjee, and A. Chattopadhyay, “Quantum circuits for toom-cook multiplication,” Phys. Rev. A
2018
Cited alongside, same era.
E. Muñoz-Coreas and H. Thapliyal, “Quantum circuit design of a t-count optimized integer multiplier,” IEEE Transactions on Computers
2018
Cited alongside, same era.
2018
Cited alongside, same era.
S. Yuan, S. Gao, C. Wen, Y. Wang, H. Qu, and Y. Wang, “A novel fault-tolerant quantum divider and its simulation,” Quantum Information Processing
2022
Later among the works it cites.
Y. He, C. Zhao, G. Dai, K. He, X. Geng, J. Liu, and W. Chen, “Quantum modular multiplier via binary-exponent-based recombination,” Quantum Information Processing
2022
Later among the works it cites.
B. D. Clader, A. M. Dalzell, N. Stamatopoulos, G. Salton, M. Berta, and W. J. Zeng, “Quantum resources required to block-encode a matrix of classical data,” IEEE Transactions on Quantum Engineering
2022
Later among the works it cites.
D. Camps, L. Lin, R. Van Beeumen, and C. Yang, “Explicit quantum circuits for block encodings of certain sparse matrices,” 2022
2022
Later among the works it cites.
P. Rebentrost, A. Luongo, S. Bosch, and S. Lloyd, “Quantum computational finance: martingale asset pricing for incomplete markets,” 2022
2022
Later among the works it cites.
M. Cerezo, G. Verdon, H.-Y. Huang, L. Cincio, and P. J. Coles, “Challenges and opportunities in quantum machine learning,” Nature Computational Science
2022
Later among the works it cites.
M. C. Caro, H.-Y. Huang, M. Cerezo, K. Sharma, A. Sornborger, L. Cincio, and P. J. Coles, “Generalization in quantum machine learning from few training data,” Nature Communications
2022
Later among the works it cites.
M. Maronese, C. Destri, and E. Prati, “Quantum activation functions for quantum neural networks,” 2022
2022
Later among the works it cites.
S. Sajadimanesh, J. P. L. Faye, and E. Atoofian, “Nisq-friendly non-linear activation functions for quantum neural networks,” in 2022 IEEE International Conference on Networking, Architecture and Storage (NAS)
2022
Later among the works it cites.
D. Koch, M. Samodurov, A. Projansky, and P. M. Alsing, “Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits,” International Journal of Quantum Information
2022
Later among the works it cites.
P. Atchade-Adelomou and S. Gonzalez, “Efficient quantum modular arithmetics for the isq era,” 2023
2023
Later among the works it cites.
D. C. McKay, I. Hincks, E. J. Pritchett, M. Carroll, L. C. G. Govia, and S. T. Merkel, “Benchmarking quantum processor performance at scale,” 2023
2023
Later among the works it cites.
E. Berg, Z. Minev, A. Kandala, and K. Temme, “Probabilistic error cancellation with sparse pauli–lindblad models on noisy quantum processors,” Nature Physics
2023
Later among the works it cites.
S. Wang, A. Baksi, and A. Chattopadhyay, “A higher radix architecture for quantum carry-lookahead adder,” Scientific Reports
2023
Later among the works it cites.
S. Wang and A. Chattopadhyay, “Reducing depth of quantum adder using ling structure,” in VLSI-SoC
2023
Later among the works it cites.
S. Çakmak, M. Kurt, and A. Gençten, “Qft based quantum arithmetic logic unit on ibm quantum computer,” 2023
2023
Later among the works it cites.
E. Faghih, M. Taheri, K. Navi, and N. Bagherzadeh, “Efficient realization of quantum balanced ternary reversible multiplier building blocks: A great step towards sustainable computing,” Sustainable Computing: Informatics and Systems
2023
Later among the works it cites.
D. S. C. Putranto, R. W. Wardhani, H. T. Larasati, and H. Kim, “Space and time-efficient quantum multiplier in post quantum cryptography era,” IEEE Access
2023
Later among the works it cites.
F. Orts, E. Filatovas, G. Ortega, J. SanJuan-Estrada, and E. Garzón, “Improving the number of t gates and their spread in integer multipliers on quantum computing,” Physical Review A
2023
Later among the works it cites.
J. Nie, Q. Zhu, M. Li, and X. Sun, “Quantum circuit design for integer multiplication based on schönhage-strassen algorithm,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
2023
Later among the works it cites.
K. Jang, W. Kim, S. Lim, Y. Kang, Y. Yang, and H. Seo, “Quantum binary field multiplication with optimized toffoli depth and extension to quantum inversion,” Sensors
2023
Later among the works it cites.
E. Hansen, S. Joshi, and H. Rarick, “Resource estimation of quantum multiplication algorithms,” in 2023 IEEE International Conference on Quantum Computing and Engineering (QCE)
2023
Later among the works it cites.
J. Zhan, “Quantum multiplier based on exponent adder,” arXiv preprint arXiv:2309.10204
2023
Later among the works it cites.
M. Ramezani, M. Nikaeen, F. Farman, S. M. Ashrafi, and A. Bahrampour, “Quantum multiplication algorithm based on the convolution theorem,” Physical Review A
2023
Later among the works it cites.
Y. Yuan, C. Wang, B. Wang, Z.-Y. Chen, M.-H. Dou, Y.-C. Wu, and G.-P. Guo, “An improved qft-based quantum comparator and extended modular arithmetic using one ancilla qubit,” New Journal of Physics
2023
Later among the works it cites.
2023
Later among the works it cites.
B. Park and D. Ahn, “Reducing cnot count in quantum fourier transform for the linear nearest-neighbor architecture,” Scientific Reports
2023
Later among the works it cites.
S. Lim, H. Kim, K. Jang, S. Wang, A. Baksi, A. Chattopadhyay, and H. Seo, “Optimized quantum circuit implementation of payoff function,” in 2023 IFIP/IEEE 31st International Conference on Very Large Scale Integration (VLSI-SoC)
2023
Later among the works it cites.
P.-W. Huang, X. Li, K. Koor, and P. Rebentrost, “Hybrid quantum-classical and quantum-inspired classical algorithms for solving banded circulant linear systems,” 2023
2023
Later among the works it cites.
D. Herman, C. Googin, X. Liu, Y. Sun, A. Galda, I. Safro, M. Pistoia, and Y. Alexeev, “Quantum computing for finance,” Nature Reviews Physics
2023
Later among the works it cites.
Z. Udvarnoki, G. Fáth, and N. Fogarasi, “Quantum advantage of monte carlo option pricing,” Journal of Physics Communications
2023
Later among the works it cites.
S. Jerbi, L. J. Fiderer, H. Poulsen Nautrup, J. M. Kübler, H. J. Briegel, and V. Dunjko, “Quantum machine learning beyond kernel methods,” Nature Communications
2023
Later among the works it cites.
A. Katabarwa, K. Gratsea, A. Caesura, and P. D. Johnson, “Early fault-tolerant quantum computing,” 2023
2023
Later among the works it cites.
J. Yao, N. B. Erichson, and M. E. Lopes, “Error estimation for random fourier features,” 2023
2023
Later among the works it cites.
S. Wang, S. Deb, A. Mondal, and A. Chattopadhyay, “Optimal toffoli-depth quantum adder,” 2024
2024
Closest in time.
2024
Closest in time.
2024
Closest in time.
S. Sajadimanesh and E. Atoofian, “Implementation of a quantum division circuit on noisy intermediate-scale quantum devices using dynamic circuits and approximate computing,” Phys. Rev. A
2024
Closest in time.
F. Orts, R. Paulavičius, and E. Filatovas, “Quantum circuit optimization of an integer divider,” Journal of Systems and Software
2024
Closest in time.
W. Zi, S. Wang, H. Kim, X. Sun, A. Chattopadhyay, and P. Rebentrost, “Efficient quantum circuits for machine learning activation functions including constant t-depth relu,” 2024
2024
Closest in time.
C. Sünderhauf, E. Campbell, and J. Camps, “Block-encoding structured matrices for data input in quantum computing,” Quantum
2024
Closest in time.
N. Guseynov, X. Huang, and N. Liu, “Explicit gate construction of block-encoding for hamiltonians needed for simulating partial differential equations,” 2024
2024
Closest in time.
N. Stamatopoulos and W. J. Zeng, “Derivative pricing using quantum signal processing,” Quantum
2024
Closest in time.
Q. T. Nguyen, L. Schatzki, P. Braccia, M. Ragone, P. J. Coles, F. Sauvage, M. Larocca, and M. Cerezo, “Theory for equivariant quantum neural networks,” PRX Quantum
2024
Closest in time.
IntechOpen, Apr. 2024
R. Kshirsagar, Robust Quantum Algorithms for Early Fault-Tolerant Quantum Computing · 2024
Closest in time.
C. Sünderhauf, E. Campbell, and J. Camps, “Block-encoding structured matrices for data input in quantum computing,” Quantum
2024
Closest in time.