Fetching the paper…
Reading the bibliography…
Quantum state preparation is an important ingredient for other higher-level quantum algorithms, such as Hamiltonian simulation, or for loading distributions into a quantum device to be used e.g.
“Obstacles to State Preparation and Variational Optimization from Symmetry Protection”, 2019
Sergey Bravyi, Alexander Kliesch, Robert Koenig and Eugene Tang · 1910
Earlier work this paper cites.
“Five two-bit quantum gates are sufficient to implement the quantum Fredkin gate”
John. Smolin and David. DiVincenzo · 1996
Earlier work this paper cites.
“Synthesis of Quantum Superpositions by Quantum Computation”
Lov. Grover · 2000
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.
“Quantum random walks - an introductory overview”
Julia Kempe · 2003
Earlier work this paper cites.
“Transformation of quantum states using uniformly controlled rotations”
Mikko Mottonen, Juha. Vartiainen, Ville Bergholm and Martti. Salomaa · 2004
Earlier work this paper cites.
“A new quantum ripple-carry addition circuit”, 2004
Steven. Cuccaro, Thomas. Draper, Samuel. Kutin and David Moulton · 2004
Earlier work this paper cites.
“Efficient state preparation for a register of quantum bits”
Andrei. Soklakov and Rüdiger Schack · 2006
Earlier work this paper cites.
“Quantum Walk Based Search Algorithms”
Miklos Santha · 2008
Earlier work this paper cites.
“A divide-and-conquer algorithm for quantum state preparation”, 2020
Israel. Araujo, Daniel. Park, Francesco Petruccione and Adenilton. da Silva · 2008
Cited alongside, same era.
“Quantum Algorithm for Linear Systems of Equations”
Aram. Harrow, Avinatan Hassidim and Seth Lloyd · 2009
Cited alongside, same era.
“Black-box Hamiltonian simulation and unitary implementation”, 2009
Dominic. Berry and Andrew. Childs · 2009
Cited alongside, same era.
“On the Relationship Between Continuous- and Discrete-Time Quantum Walk”
Andrew. Childs · 2009
Cited alongside, same era.
“Quantum search with advice”, 2009, pp. 1–14
Ashley Montanaro · 2009
Cited alongside, same era.
“Quantum Computation and Quantum Information”
“Fixed-Point Quantum Search with an Optimal Number of Queries”
Theodore. Yoder, Guang Low and Isaac. Chuang · 2014
Later among the works it cites.
“Hamiltonian simulation with nearly optimal dependence on all parameters”, 2015
Dominic. Berry, Andrew. Childs and Robin Kothari · 2015
Later among the works it cites.
“Decompositions of n-qubit Toffoli Gates with Linear Circuit Complexity”
Yong He, Ming-Xing Luo, E. Zhang, Hong-Ke Wang and Xiao-Feng Wang · 2017
Later among the works it cites.
“Halving the cost of quantum addition”
Craig Gidney · 2018
Later among the works it cites.
“Black-Box Quantum State Preparation without Arithmetic”
Yuval. Sanders, Guang Low, Artur Scherer and Dominic. Berry · 2019
Later among the works it cites.
“Quantum SDP Solvers: Large Speed-ups, Optimality, and Applications to Quantum Learning”
Fernando… Brandão, Amir Kalev, Tongyang Li, Cedric-Yu Lin, Krysta. Svore and Xiaodi Wu · 2019
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Michael. Nielsen and Isaac. Chuang · 2010
Cited alongside, same era.
“Quantum-state preparation with universal gate decompositions”
Martin Plesch and Časlav Brukner · 2011
Cited alongside, same era.
“Faster quantum chemistry simulation on fault-tolerant quantum computers”
N Cody Jones, James. Whitfield, Peter. McMahon, Man-Hong Yung, Rodney Meter, Alán Aspuru-Guzik and Yoshihisa Yamamoto · 2012
Cited alongside, same era.
Later among the works it cites.
“Quantum Generative Adversarial Networks for learning and loading random distributions”
Christa Zoufal, Aurélien Lucchi and Stefan Woerner · 2019
Later among the works it cites.
“Quantum supremacy using a programmable superconducting processor”
Quantum Google et al · 2019
Later among the works it cites.