Fetching the paper…
Reading the bibliography…
We consider the quantum complexity of computing Schatten $p$-norms and related quantities, and find that the problem of estimating these quantities is closely related to the one clean qubit model of computation.
Universal quantum simulators
S. Lloyd · 1996
Earlier work this paper cites.
Power of one bit of quantum information
E. Knill and R. Laflamme · 1998
Earlier work this paper cites.
On power-law relationships of the internet topology
M. Faloutsos, P. Faloutsos, and C. Faloutsos · 1999
Earlier work this paper cites.
The energy of a graph: old and new results
I. Gutman · 2001
Earlier work this paper cites.
Quantum computing and quadratically signed weight enumerators
E. Knill and R. Laflamme · 2001
Earlier work this paper cites.
Quantum NP-a survey
D. Aharonov and T. Naveh · 2002
Earlier work this paper cites.
Classical and quantum computation
A. Kitaev, A. Shen, and M. Vyalyi · 2002
Earlier work this paper cites.
Spectra of random graphs with given expected degrees
F. Chung, L. Lu, and V. Vu · 2003
Earlier work this paper cites.
A polynomial quantum algorithm for approximating the Jones polynomial
D. Aharonov, V. Jones, and Z. Landau · 2006
Earlier work this paper cites.
The Solovay-Kitaev algorithm
C. Dawson and M. Nielsen · 2006
Earlier work this paper cites.
On promise problems: A survey
O. Goldreich · 2006
Cited alongside, same era.
BQP-complete problems concerning mixing properties of classical random walks on sparse graphs
D. Janzing and P. Wocjan · 2006
Cited alongside, same era.
The complexity of the local Hamiltonian problem
J. Kempe, A. Kitaev, and O. Regev · 2006
Cited alongside, same era.
Contractivity of positive and trace-preserving maps under L p {L_{p}} norms
D. Perez-Garcia, M. Wolf, D. Petz, and M. Ruskai · 2006
Cited alongside, same era.
Computation with unitaries and one pure qubit
D. Shepherd · 2006
Cited alongside, same era.
Efficient quantum algorithms for simulating sparse Hamiltonians
D. Berry, G. Ahokas, R. Cleve, and B. Sanders · 2007
Cited alongside, same era.
Estimating Jones polynomials is a complete problem for one clean qubit
P. Shor and S. Jordan · 2008
Later among the works it cites.
Quantum algorithm for linear systems of equations
A. Harrow, A. Hassidim, and S. Lloyd · 2009
Later among the works it cites.
Quantum computational complexity
J. Watrous · 2009
Later among the works it cites.
Quantum computation and quantum information
M. Nielsen and I. Chuang · 2010
Later among the works it cites.
Graph energy
X. Li, Y. Shi, and I. Gutman · 2012
Later among the works it cites.
Hardness of classically simulating the one-clean-qubit model
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A Simple PromiseBQP-complete Matrix Problem
D. Janzing and P. Wocjan · 2007
Cited alongside, same era.
A. Ben-Aroya, O. Regev, and R. de Wolf · 2008
Cited alongside, same era.
Counterexamples to the maximal p p -norm multiplicativity conjecture for all p > 1 p>1
P. Hayden and A. Winter · 2008
Cited alongside, same era.
T. Morimae, K. Fujii, and J. F. Fitzsimons · 2014
Later among the works it cites.
Hamiltonian simulation with nearly optimal dependence on all parameters
D. W. Berry, A. Childs, and R. Kothari · 2015
Later among the works it cites.
Corrected quantum walk for optimal Hamiltonian simulation
D. W. Berry and L. Novo · 2016
Later among the works it cites.
Hardness of classically sampling one clean qubit model with constant total variation distance error
T. Morimae · 2017
Closest in time.