A Q# Implementation of a Quantum Lookup Table for Quantum Arithmetic Functions

E. Y. Remez, “Sur la détermination des polynômes d’approximation de degré donnée,” Comm. Soc. Math. Kharkov, vol 10, 41–63, 1934

1934

Earlier work this paper cites.

A. Mishchenko and M. Perkowski, “Fast Heuristic Minimization of Exclusive-Sums-of-Products”, 5th International Reed-Muller Workshop, September 2001

2001

Earlier work this paper cites.

T. Draper, S. Kutin, E. Rains, and K. Svore, “A logarithmic-depth quantum carry-lookahead adder,” arXiv:quant-ph/0406142v1, June 2004

2004

Earlier work this paper cites.

C. Jones “Low-overhead constructions for the fault-tolerant Toffoli gate,” Phys. Rev. A, vol 87, 022328, February 2013

2013

Earlier work this paper cites.

E. T. Campbell, B. M. Terhal and C. Vuillot, “Roads towards fault-tolerant universal quantum computation,” Nature vol 549, 172-179, 2017

2017

Cited alongside, same era.

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,” Real World Domain Specific Languages Workshop, pp, 7:1–7:10, 2018

2018

Cited alongside, same era.

T. Häner, M. Roetteler, and K. M. Svore, “Optimizing Quantum Circuits for Arithmetic,” arXiv:1805.12445, May 2018

Original

2018

Cited alongside, same era.

M. Soeken, M. Roetteler, N. Wiebe, and G. De Micheli, “LUT-Based Hierarchical Reversible Logic Synthesis,” IEEE Trans. on CAD vol 38, 1675–1688, July 2018

2018

Cited alongside, same era.

S. al-D. al-Tusi, “Treatise on Equations,” 1209

Cited in the paper.

L. Euler, “Institutiones Calculi Differentialis,” 1755

Cited in the paper.

G. Hao Low, V. Kliuchnikov, and Luke Schaeffer, “Trading T-gates for dirty qubits in state preparation and unitary synthesis,” arXiv:1812.00954, December 2018

Original

2018

Later among the works it cites.

R. Babbush, C. Gidney, D. W. Berry, N. Wiebe, J. McClean, A. Paler, A. Fowler, and H. Neven, “Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity,” Phys. Rev. X, vol. 8, 041015, October 2018

2018

Later among the works it cites.

S. Dutta, Y. Tavva, D. Bhattacharjee and A. Chattopadhyay, “Efficient Quantum Circuits for Square-Root and Inverse Square-Root,” 2020 33rd International Conference on VLSI Design and 2020 19th International Conference on Embedded Systems (VLSID), pp. 55-60, June 2020

2020

Later among the works it cites.

B. Poirier, “Efficient Evaluation of Exponential and Gaussian Functions on a Quantum Computer,” arXiv:2110.05653, October 2021

Original

2021

Later among the works it cites.