Fetching the paper…
Reading the bibliography…
Algorithms with unitary oracles can be nested, which makes them extremely versatile.
Q. Dong, S. Nakayama, A. Soeda, and M. Murao · 1911
Earlier work this paper cites.
Drei sätze über die n-dimensionale euklidische sphäre
K. Borsuk · 1933
Earlier work this paper cites.
Spin echoes
E. L. Hahn · 1950
Earlier work this paper cites.
A single quantum cannot be cloned
W. K. Wootters and W. H. Zurek · 1982
Earlier work this paper cites.
Simulating physics with computers
R. P. Feynman · 1982
Earlier work this paper cites.
Average case complete problems
L. A. Levin · 1986
Earlier work this paper cites.
Algorithms for quantum computation: discrete logarithms and factoring
P. W. Shor · 1994
Earlier work this paper cites.
Elementary gates for quantum computation
A. Barenco, C. H. Bennett, R. Cleve, D. P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter · 1995
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
L. K. Grover · 1996
Earlier work this paper cites.
Quantum copying: Beyond the no-cloning theorem
V. Bužek and M. Hillery · 1996
Earlier work this paper cites.
Universal quantum simulators
S. Lloyd · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Programmable quantum gate arrays
M. A. Nielsen and I. L. Chuang · 1997
Earlier work this paper cites.
Quantum copying: A network
V. Bužek, S. L. Braunstein, M. Hillery, and D. Bruß · 1997
Earlier work this paper cites.
Optimal quantum cloning machines
N. Gisin and S. Massar · 1997
Earlier work this paper cites.
Simulation of many-body fermi systems on a universal quantum computer
D. S. Abrams and S. Lloyd · 1997
Earlier work this paper cites.
Prescription for experimental determination of the dynamics of a quantum black box
I. L. Chuang and M. A. Nielsen · 1997
Earlier work this paper cites.
Complete characterization of a quantum process: the two-bit quantum gate
J. Poyatos, J. I. Cirac, and P. Zoller · 1997
Earlier work this paper cites.
Probabilistic cloning and identification of linearly independent quantum states
L.-M. Duan and G.-C. Guo · 1998
Earlier work this paper cites.
Optimal universal quantum cloning and state estimation
D. Bruss, A. Ekert, and C. Macchiavello · 1998
Earlier work this paper cites.
Optimal cloning of pure states
R. F. Werner · 1998
Earlier work this paper cites.
Quantum circuits with mixed states
D. Aharonov, A. Kitaev, and N. Nisan · 1998
Earlier work this paper cites.
Optimal manipulations with qubits: Universal-not gate
V. Bužek, M. Hillery, and R. F. Werner · 1999
Earlier work this paper cites.
Strategies and networks for state-dependent quantum cloning
A. Chefles and S. M. Barnett · 1999
Earlier work this paper cites.
Optimal cloning of pure states, testing single clones
M. Keyl and R. F. Werner · 1999
Earlier work this paper cites.
Quantum lower bounds by quantum arguments
A. Ambainis · 2000
Earlier work this paper cites.
Impossibility of deleting an unknown quantum state
A. K. Pati and S. L. Braunstein · 2000
Earlier work this paper cites.
Towards robust quantum computation
D. W. C. Leung · 2000
Cited alongside, same era.
Algebraic topology
A. Hatcher · 2000
Cited alongside, same era.
Topology
J. R. Munkres · 2000
Cited alongside, same era.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 2001
Cited alongside, same era.
Quantum kolmogorov complexity based on classical descriptions
P. M. Vitányi · 2001
Cited alongside, same era.
Quantum cryptography
N. Gisin, G. Ribordy, W. Tittel, and H. Zbinden · 2002
Cited alongside, same era.
Storing quantum dynamics in quantum states: A stochastic programmable gate
G. Vidal, L. Masanes, and J. I. Cirac · 2002
The computational complexity of linear optics
S. Aaronson and A. Arkhipov · 2011
Later among the works it cites.
Notes on distinguishability of postselected computations
Z. Gavorová · 2011
Later among the works it cites.
Quantum tasks in minkowski space
A. Kent · 2012
Later among the works it cites.
Quantum correlations with no causal order
O. Oreshkov, F. Costa, and Č. Brukner · 2012
Later among the works it cites.
Quantum computations without definite causal structure
G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Valiron · 2013
Later among the works it cites.
Limitations on quantum subroutine designing due to the linear structure of quantum operators
A. Soeda · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Quantum computation and quantum information, 2002
M. A. Nielsen and I. Chuang · 2002
Cited alongside, same era.
Fermionic quantum computation
S. B. Bravyi and A. Y. Kitaev · 2002
Cited alongside, same era.
Complexity measures and decision tree complexity: a survey
H. Buhrman and R. de Wolf · 2002
Cited alongside, same era.
Efficient quantum algorithms for estimating gauss sums
W. Van Dam and G. Seroussi · 2002
Cited alongside, same era.
Smoothed analysis of the perceptron algorithm for linear programming
A. Blum and J. Dunagan · 2002
Cited alongside, same era.
Quantum circuits cannot control unknown operations
M. Araújo, A. Feix, F. Costa, and Č. Brukner · 2014
Later among the works it cites.
Computational advantage from quantum-controlled ordering of gates
M. Araújo, F. Costa, and Č. Brukner · 2014
Later among the works it cites.
Experimental superposition of orders of quantum gates
L. M. Procopio, A. Moqanaki, M. Araújo, F. Costa, I. Alonso Calafell, E. G. Dowd, D. R. Hamel, L. A. Rozema, Č. Brukner, and P. Walther · 2015
Later among the works it cites.
Smoothed complexity theory
M. Bläser and B. Manthey · 2015
Later among the works it cites.
The space of logically consistent classical processes without causal order
Ä. Baumeler and S. Wolf · 2016
Later among the works it cites.
Quantum speed-ups for solving semidefinite programs
F. G. Brandao and K. M. Svore · 2017
Later among the works it cites.
Experimental verification of an indefinite causal order
G. Rubino, L. A. Rozema, A. Feix, M. Araújo, J. M. Zeuner, L. M. Procopio, Č. Brukner, and P. Walther · 2017
Later among the works it cites.
Introduction to symplectic topology
D. McDuff and D. Salamon · 2017
Later among the works it cites.
Indefinite causal order in a quantum switch
K. Goswami, C. Giarmatzi, M. Kewming, F. Costa, C. Branciard, J. Romero, and A. G. White · 2018
Later among the works it cites.
Quantum plug n’play: modular computation in the quantum regime
J. Thompson, K. Modi, V. Vedral, and M. Gu · 2018
Later among the works it cites.
Optimal probabilistic storage and retrieval of unitary channels
M. Sedlák, A. Bisio, and M. Ziman · 2019
Later among the works it cites.
Complex conjugation supermap of unitary quantum maps and its universal implementation protocol
J. Miyazaki, A. Soeda, and M. Murao · 2019
Later among the works it cites.
Reversing unknown quantum transformations: Universal quantum circuit for inverting general unitary operations
M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao · 2019
Later among the works it cites.
Probabilistic exact universal quantum circuits for transforming unitary operations
M. T. Quintino, Q. Dong, A. Shimbo, A. Soeda, and M. Murao · 2019
Later among the works it cites.
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
A. Gilyén, Y. Su, G. H. Low, and N. Wiebe · 2019
Later among the works it cites.
Time-delocalized quantum subsystems and operations: on the existence of processes with indefinite causal structure in quantum mechanics
O. Oreshkov · 2019
Later among the works it cites.
Quantum SDP-solvers: Better upper and lower bounds
J. Van Apeldoorn, A. Gilyén, S. Gribling, and R. de Wolf · 2020
Closest in time.
Optimal universal programming of unitary gates
Y. Yang, R. Renner, and G. Chiribella · 2020
Closest in time.
Causal orders, quantum circuits and spacetime: distinguishing between definite and superposed causal orders
N. Paunković and M. Vojinović · 2020
Closest in time.
Projected least-squares quantum process tomography
T. Surawy-Stepney, J. Kahn, R. Kueng, and M. Guta · 2022
Closest in time.
Holomorphic representation of quantum computations
U. Chabaud and S. Mehraban · 2022
Closest in time.