The following pages link to Andrew M. Childs (Q380045):
Displaying 50 items.
- A framework for bounding nonlocality of state discrimination (Q380047) (← links)
- Quantum computation of discrete logarithms in semigroups (Q490342) (← links)
- On the relationship between continuous- and discrete-time quantum walk (Q625458) (← links)
- The limitations of nice mutually unbiased bases (Q871276) (← links)
- Quantum algorithm for linear differential equations with exponentially improved dependence on precision (Q1686025) (← links)
- Non-interactive classical verification of quantum computation (Q2119074) (← links)
- Quantum spectral methods for differential equations (Q2174656) (← links)
- An example of the difference between quantum and classical random walks (Q2573073) (← links)
- Levinson's theorem for graphs (Q2849706) (← links)
- Levinson's theorem for graphs II (Q2872305) (← links)
- The Quantum Query Complexity of Read-Many Formulas (Q2912853) (← links)
- (Q2934718) (← links)
- (Q2958409) (← links)
- Universal Computation by Multiparticle Quantum Walk (Q2961970) (← links)
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS (Q2971052) (← links)
- Discrete-query quantum algorithm for NAND trees (Q3002804) (← links)
- Any AND-OR Formula of Size <i>N</i> Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer (Q3068642) (← links)
- Simulating Sparse Hamiltonians with Star Decompositions (Q3070979) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Quantum Property Testing for Bounded-Degree Graphs (Q3088108) (← links)
- Spatial search and the Dirac equation (Q3102517) (← links)
- (Q3113728) (← links)
- (Q3166193) (← links)
- (Q3171623) (← links)
- (Q3172424) (← links)
- (Q3172449) (← links)
- (Q3467512) (← links)
- Optimal Quantum Adversary Lower Bounds for Ordered Search (Q3521972) (← links)
- (Q3522370) (← links)
- (Q3522422) (← links)
- (Q3522545) (← links)
- (Q3522560) (← links)
- (Q3522638) (← links)
- Reversible Simulation of Bipartite Product Hamiltonians (Q3546712) (← links)
- Exponential algorithmic speedup by a quantum walk (Q3581288) (← links)
- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem (Q3590967) (← links)
- Optimal measurements for the dihedral hidden subgroup problem (Q3594442) (← links)
- Quantum algorithm for multivariate polynomial interpolation (Q4556869) (← links)
- (Q4598149) (← links)
- Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision (Q4602374) (← links)
- (Q4903867) (← links)
- Quantum Query Complexity of Minor-Closed Graph Properties (Q4910570) (← links)
- Toward the first quantum simulation with quantum speedup (Q4967461) (← links)
- (Q5089148) (← links)
- The Bose-Hubbard Model is QMA-complete (Q5167751) (← links)
- TWO-WAY QUANTUM COMMUNICATION CHANNELS (Q5291269) (← links)
- Time-Efficient Quantum Walks for 3-Distinctness (Q5326554) (← links)
- Constructing elliptic curve isogenies in quantum subexponential time (Q5396023) (← links)
- Product formulas for exponentials of commutators (Q5402337) (← links)
- Interpolatability distinguishes LOCC from separable von Neumann measurements (Q5410939) (← links)
