Fetching the paper…
Reading the bibliography…
Loading functions into quantum computers represents an essential step in several quantum algorithms, such as quantum partial differential equation solvers.
“State preparation based on quantum phase estimation” (2019)
Jian Zhao, Yu-Chun Wu, Guang-Can Guo, and Guo-Ping Guo · 1912
Earlier work this paper cites.
“A closed set of normal orthogonal functions”
J. L. Walsh · 1923
Earlier work this paper cites.
“The approximation of one matrix by another of lower rank”
Carl Eckart and G. Marion Young · 1936
Earlier work this paper cites.
E. Y. Remez, “General computational methods of Chebyshev approximation: The problems with linear real parameters”, US Atomic Energy Commission, Division of Technical Information (1962)
1962
Earlier work this paper cites.
“A Survey of Methods of Computing Minimax and Near-Minimax Polynomial Approximations for Functions of a Single Independent Variable”, Journal of the ACM 12
W. Fraser · 1965
Earlier work this paper cites.
“Function approximation by walsh series”
Chung-Kwong Yuen · 1975
Earlier work this paper cites.
“Elementary gates for quantum computation”
Adriano Barenco, Charles H. Bennett, Richard Cleve, David P. DiVincenzo, Norman Margolus, Peter Shor, Tycho Sleator, John A. Smolin, and Harald Weinfurter · 1995
Earlier work this paper cites.
“Schur parameters, factorization, and dilation problems”
T. Constantinescu · 1996
Earlier work this paper cites.
“Synthesis of quantum superpositions by quantum computation”
Lov K. Grover · 2000
Earlier work this paper cites.
“Quantum embeddings for machine learning” (2020)
Seth Lloyd, Maria Schuld, Aroosa Ijaz, Josh Izaac, and Nathan Killoran · 2001
Earlier work this paper cites.
“Creating superpositions that correspond to efficiently integrable probability distributions” (2002)
Lov Grover and Terry Rudolph · 2002
Earlier work this paper cites.
“Efficient classical simulation of slightly entangled quantum computations”
Guifré Vidal · 2003
Earlier work this paper cites.
“Singular value decomposition and principal component analysis”
Michael E. Wall, Andreas Rechtsteiner, and Luis M. Rocha · 2003
Earlier work this paper cites.
“Finding angles for quantum signal processing with machine precision” (2020)
Rui Chao, Dawei Ding, Andras Gilyen, Cupjin Huang, and Mario Szegedy · 2003
Earlier work this paper cites.
“Transformation of quantum states using uniformly controlled rotations” (2004)
Mikko Mottonen, Juha J. Vartiainen, Ville Bergholm, and Martti M. Salomaa · 2004
Earlier work this paper cites.
“Minimal universal two-qubit controlled-NOT-based circuits”
Vivek V. Shende, Igor L. Markov, and Stephen S. Bullock · 2004
Earlier work this paper cites.
Adam Holmes and A. Y. Matsuura · 2005
Earlier work this paper cites.
“Sequential generation of entangled multiqubit states”
C. Schön, E. Solano, F. Verstraete, J. I. Cirac, and M. M. Wolf · 2005
Earlier work this paper cites.
“Matrix product state representations”
D. Perez-Garcia, F. Verstraete, M. M. Wolf, and J. I. Cirac · 2007
Earlier work this paper cites.
“A quantum algorithm to solve nonlinear differential equations” (2008)
Sarah K. Leyton and Tobias J. Osborne · 2008
Earlier work this paper cites.
“Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems”
F. Verstraete, V. Murg, and J.I. Cirac · 2008
Earlier work this paper cites.
“Entropy scaling and simulability by matrix product states”
Norbert Schuch, Michael M. Wolf, Frank Verstraete, and J. Ignacio Cirac · 2008
Earlier work this paper cites.
“Quantum algorithm for linear systems of equations”
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
“Entanglement properties of quantum superpositions of smooth, differentiable functions” (2020)
Adam Holmes and A. Y. Matsuura · 2009
Earlier work this paper cites.
“Polynomial approximation in hierarchical tucker format by vector - tensorization” (2010). Mathematics, Computer Science
Lars Grasedyck · 2010
Earlier work this paper cites.
“Constructive representation of functions in low-rank tensor formats”
Ivan Oseledets · 2010
Earlier work this paper cites.
“The density-matrix renormalization group in the age of matrix product states”
Ulrich Schollwöck · 2011
Earlier work this paper cites.
“The density-matrix renormalization group in the age of matrix product states”
Ulrich Schollwöck · 2011
Earlier work this paper cites.
“Quantum algorithm for data fitting”
Nathan Wiebe, Daniel Braun, and Seth Lloyd · 2012
Earlier work this paper cites.
“Preconditioned quantum linear system algorithm”
B. D. Clader, B. C. Jacobs, and C. R. Sprouse · 2013
Earlier work this paper cites.
“A practical introduction to tensor networks: Matrix product states and projected entangled pair states”
Román Orús · 2014
Earlier work this paper cites.
“Efficient quantum circuits for diagonal unitaries without ancillas”
Jonathan Welch, Daniel Greenbaum, Sarah Mostame, and Alan Aspuru-Guzik · 2014
Earlier work this paper cites.
“Methodology of resonant equiangular composite quantum gates”
Guang Hao Low, Theodore J. Yoder, and Isaac L. Chuang · 2016
Earlier work this paper cites.
“Quantum algorithm for systems of linear equations with exponentially improved dependence on precision”
Andrew M. Childs, Robin Kothari, and Rolando D. Somma · 2017
Earlier work this paper cites.
“Concrete resource analysis of the quantum linear-system algorithm used to compute the electromagnetic scattering cross section of a 2d target”
Artur Scherer, Benoît Valiron, Siun-Chuon Mau, Scott Alexander, Eric van den Berg, and Thomas E. Chapuran · 2017
Earlier work this paper cites.
“Quantum algorithm for linear differential equations with exponentially improved dependence on precision”
Dominic W. Berry, Andrew M. Childs, Aaron Ostrander, and Guoming Wang · 2017
Cited alongside, same era.
“Optimal hamiltonian simulation by quantum signal processing”
Guang Hao Low and Isaac L. Chuang · 2017
Cited alongside, same era.
“Quantum computational finance: Monte carlo pricing of financial derivatives”
Patrick Rebentrost, Brajesh Gupt, and Thomas R. Bromley · 2018
Cited alongside, same era.
“Quantum computing in the NISQ era and beyond”
John Preskill · 2018
Cited alongside, same era.
“Multigrid renormalization”
Michael Lubasch, Pierre Moinier, and Dieter Jaksch · 2018
Cited alongside, same era.
“Quantum computing for finance: Overview and prospects”
Román Orús, Samuel Mugel, and Enrique Lizaso · 2019
Cited alongside, same era.
Dong An, Di Fang, Stephen Jordan, Jin-Peng Liu, Guang Hao Low, and Jiasu Wang, “Efficient quantum algorithm for nonlinear reaction-diffusion equations and energy estimation,” (2022) · 2022
Later among the works it cites.
Yen Ting Lin, Robert B. Lowrie, Denis Aslangil, Yiğit Subaşı, and Andrew T. Sornborger , “Koopman-von Neumann mechanics and the Koopman representation: A perspective on solving nonlinear dynamical systems with quantum computers,” (2022) · 2022
Later among the works it cites.
Phys. Rev. A, vol. 105, p. 052404 , (2022)
Dimitrios Giannakis, Abbas Ourmazd, Philipp Pfeffer, Joerg Schumacher, and Joanna Slawinska, “Embedding classical dynamics in a quantum computer,” · 2022
Later among the works it cites.
Physica D: Nonlinear Phenomena, vol. 440, p. 133450 , (2022)
François Gay-Balmaz and Cesare Tronci, “Evolution of hybrid quantum–classical wavefunctions,” · 2022
Later among the works it cites.
“Quantum state preparation without coherent arithmetic” (2022)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Proceedings of the Royal Society A, vol. 475, no. 2229, p. 20180879 , (2019)
Denys I. Bondar, François Gay-Balmaz and Cesare Tronci, “Koopman wavefunctions and classical–quantum correlation dynamics,” · 2019
Cited alongside, same era.
“Supervised learning with quantum-enhanced feature spaces”
Vojtěch Havlíček, Antonio D. Córcoles, Kristan Temme, Aram W. Harrow, Abhinav Kandala, Jerry M. Chow, and Jay M. Gambetta · 2019
Cited alongside, same era.
“Black-box quantum state preparation without arithmetic”
Yuval R. Sanders, Guang Hao Low, Artur Scherer, and Dominic W. Berry · 2019
Cited alongside, same era.
“Quantum generative adversarial networks for learning and loading random distributions”
Christa Zoufal, Aurélien Lucchi, and Stefan Woerner · 2019
Cited alongside, same era.
“Hamiltonian Simulation by Qubitization”
Guang Hao Low and Isaac L. Chuang · 2019
Cited alongside, same era.
“Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics”
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Cited alongside, same era.
Sam McArdle, András Gilyén, and Mario Berta · 2022
Later among the works it cites.
“Fast Black-Box Quantum State Preparation”
Johannes Bausch · 2022
Later among the works it cites.
“Preparing arbitrary continuous functions in quantum registers with logarithmic complexity” (2022)
Arthur G. Rattew and Bálint Koczor · 2022
Later among the works it cites.
“Inverse-coefficient black-box quantum state preparation”
Shengbin Wang, Zhimin Wang, Runhong He, Shangshang Shi, Guolong Cui, Ruimin Shang, Jiayun Li, Yanan Li, Wendong Li, Zhiqiang Wei, and Yongjian Gu · 2022
Later among the works it cites.
“Quantum state preparation with optimal circuit depth: Implementations and applications”
Xiao-Ming Zhang, Tongyang Li, and Xiao Yuan · 2022
Later among the works it cites.
“Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicators”
Kouhei Nakaji, Shumpei Uno, Yohichi Suzuki, Rudy Raymond, Tamiya Onodera, Tomoki Tanaka, Hiroyuki Tezuka, Naoki Mitsuda, and Naoki Yamamoto · 2022
Later among the works it cites.
“Data compression for quantum machine learning”
Rohit Dilip, Yu-Jie Liu, Adam Smith, and Frank Pollmann · 2022
Later among the works it cites.
“A quantum-inspired approach to exploit turbulence structures”
Nikita Gourianov, Michael Lubasch, Sergey Dolgov, Quincy Y. van den Berg, Hessam Babaee, Peyman Givi, Martin Kiffner, and Dieter Jaksch · 2022
Later among the works it cites.
“A generalized quantum inner product and applications to financial engineering” (2022)
Vanio Markov, Charlee Stefanski, Abhijit Rao, and Constantin Gonciulea · 2022
Later among the works it cites.
“Decomposition of matrix product states into shallow quantum circuits” (2022)
Manuel S. Rudolph, Jing Chen, Jacob Miller, Atithi Acharya, and Alejandro Perdomo-Ortiz · 2022
Later among the works it cites.
“Logical quantum processor based on reconfigurable atom arrays”
Dolev Bluvstein, Simon J. Evered, Alexandra A. Geim, Sophie H. Li, Hengyun Zhou, Tom Manovitz, Sepehr Ebadi, Madelyn Cain, Marcin Kalinowski, Dominik Hangleiter, J. Pablo Bonilla Ataides, Nishad Maskara, Iris Cong, Xun Gao, Pedro Sales Rodriguez, Thomas Karolyshyn, Giulia Semeghini, Michael J. Gullans, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin · 2023
Closest in time.
“Efficient Hamiltonian simulation for solving option price dynamics”
Javier Gonzalez-Conde, Ángel Rodríguez-Rozas, Enrique Solano, and Mikel Sanz · 2023
Closest in time.
“Quantum computing for finance”
Dylan Herman, Cody Googin, Xiaoyuan Liu, Yue Sun, Alexey Galda, Ilya Safro, Marco Pistoia, and Yuri Alexeev · 2023
Closest in time.
“Quadratic quantum speedup in evaluating bilinear risk functions” (2023)
Gabriele Agliardi, Corey O’Meara, Kavitha Yogaraj, Kumar Ghosh, Piergiacomo Sabino, Marina Fernández-Campoamor, Giorgio Cortiana, Juan Bernabé-Moreno, Francesco Tacchino, Antonio Mezzacapo, and Omar Shehab · 2023
Closest in time.
“Quantum approximated cloning-assisted density matrix exponentiation” (2023)
Pablo Rodriguez-Grasa, Ruben Ibarrondo, Javier Gonzalez-Conde, Yue Ban, Patrick Rebentrost, Mikel Sanz · 2023
Closest in time.
Dylan Lewis, Stephan Eidenbenz, Balasubramanya Nadiga, and Yiğit Subaşı, “Limitations for quantum algorithms to solve turbulent and chaotic systems,” (2023) · 2023
Closest in time.
Journal of Computational Physics, vol. 487, p. 112149, (2023)
Shi Jin, Nana Liu, and Yue Yu, “Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations,” · 2023
Closest in time.
David Jennings, Matteo Lostaglio, Robert B. Lowrie, Sam Pallister, and Andrew T. Sornborger, “The cost of solving linear differential equations on a quantum computer: fast-forwarding to explicit resource counts,” (2023) · 2023
Closest in time.
David Jennings, Matteo Lostaglio, Sam Pallister, Andrew T Sornborger, and Yiğit Subaşı, “Efficient quantum linear solver algorithm with detailed running costs,” (2023) · 2023
Closest in time.
Javier Gonzalez-Conde and Andrew T. Sornborger “Mixed Quantum-Semiclassical Simulation,” (2023) · 2023
Closest in time.
“On efficient quantum block encoding of pseudo-differential operators”
H. Li, H. Ni, L. Ying · 2023
Closest in time.
Xiaoming Sun, Guojing Tian, Shuai Yang, Pei Yuan, and Shengyu Zhang · 2023
Closest in time.
“Quantum algorithms for approximate function loading”
Gabriel Marin-Sanchez, Javier Gonzalez-Conde, and Mikel Sanz · 2023
Closest in time.
“Efficient quantum state preparation with walsh series” (2023)
Julien Zylberman and Fabrice Debbasch · 2023
Closest in time.
“Linear-depth quantum circuits for loading fourier approximations of arbitrary functions”
Mudassir Moosa, Thomas W. Watts, Yiyou Chen, Abhijat Sarma, and Peter L. McMahon · 2023
Closest in time.
“Quantum state preparation using tensor networks”
Ar A Melnikov, A A Termanova, S V Dolgov, F Neukart, and M R Perelshtein · 2023
Closest in time.
“Quantum state preparation of normal distributions using matrix product states” (2023)
Jason Iaconis, Sonika Johri, and Elton Yechao Zhu · 2023
Closest in time.
“A cs guide to the quantum singular value transformation” (2023)
Ewin Tang and Kevin Tian · 2023
Closest in time.
Arthur G. Rattew and Patrick Rebentrost · 2023
Closest in time.
“Preparation of matrix product states with log-depth quantum circuits”
Daniel Malz, Georgios Styliaris, Zhi-Yuan Wei, and J. Ignacio Cirac · 2024
Closest in time.