|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 28 publication records. Showing 28 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andrew M. Childs, Debbie W. Leung, Laura Mancinska, Maris Ozols |
Characterization of universal two-qubit Hamiltonians.  |
Quantum Information & Computation  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Shelby Kimmel, Robin Kothari |
The quantum query complexity of read-many formulas |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Robin Kothari |
Quantum query complexity of minor-closed graph properties. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, Yi-Kai Liu |
Quantum Property Testing for Bounded-Degree Graphs. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani |
The quantum query complexity of certification. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Robin Kothari |
Limitations on the simulation of non-sparse Hamiltonians. |
Quantum Information & Computation |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, Yi-Kai Liu |
Quantum property testing for bounded-degree graphs |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, David Jao, Vladimir Soukharev |
Constructing elliptic curve isogenies in quantum subexponential time |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Robin Kothari |
Quantum query complexity of minor-closed graph properties |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang |
Any AND-OR Formula of Size N Can Be Evaluated in Time N1/2+o(1) on a Quantum Computer. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Robin Kothari |
Simulating Sparse Hamiltonians with Star Decompositions. |
TQC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo |
Discrete-Query Quantum Algorithm for NAND Trees. |
Theory of Computing |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, François Le Gall, Seiichiro Tani |
The quantum query complexity of certification |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Michele Mosca (eds.) |
Theory of Quantum Computation, Communication, and Cryptography, 4th Workshop, TQC 2009, Waterloo, Canada, May 11-13, 2009, Revised Selected Papers |
TCQ |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Troy Lee |
Optimal Quantum Adversary Lower Bounds for Ordered Search. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Pawel Wocjan |
On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. |
Quantum Information & Computation |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Wim van Dam |
Quantum algorithm for a generalized hidden shift problem. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Aram Wettroth Harrow, Pawel Wocjan |
Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Leonard J. Schulman, Umesh V. Vazirani |
Quantum Algorithms for Hidden Nonlinear Structures. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Andrew M. Childs, Ben Reichardt, Robert Spalek, Shengyu Zhang |
Any AND-OR Formula of Size N can be Evaluated in time N1/2+o(1) on a Quantum Computer. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dave Bacon, Andrew M. Childs, Wim van Dam |
Optimal measurements for the dihedral hidden subgroup problem. |
Chicago J. Theor. Comput. Sci. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Jason M. Eisenberg |
Quantum algorithms for subset finding. |
Quantum Information & Computation |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs |
Secure assisted quantum computation. |
Quantum Information & Computation |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dave Bacon, Andrew M. Childs, Wim van Dam |
From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Debbie W. Leung, Guifre Vidal |
Reversible Simulation of Bipartite Product Hamiltonians. |
IEEE Transactions on Information Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew M. Childs, Debbie W. Leung, Frank Verstraete, Guifre Vidal |
Asymptotic entanglement capacity of the ising and anisotropic Heisenberg interactions. |
Quantum Information & Computation |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman |
Exponential algorithmic speedup by a quantum walk. |
STOC |
2003 |
DBLP DOI BibTeX RDF |
quantum algorithms, quantum walks |
| 1 | Andrew M. Childs, Edward Farhi, Jeffrey Goldstone, Sam Gutmann |
Finding cliques by quantum adiabatic evolution. |
Quantum Information & Computation |
2002 |
DBLP BibTeX RDF |
|
Displaying result #1 - #28 of 28 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")