Result 1 to 20 of 58 total
Black-box Hamiltonian simulation and unitary implementation. (English)
Quantum Inf. Comput. 12, No. 1-2, 29-62 (2012).
1
The quantum query complexity of read-many formulas. (English)
Epstein, Leah (ed.) et al., Algorithms ‒ ESA 2012. 20th annual European symposium, Ljubljana, Slovenia, September 10‒12, 2012. Proceeding. Berlin: Springer (ISBN 978-3-642-33089-6/pbk). Lecture Notes in Computer Science 7501, 337-348 (2012).
2
Quantum query complexity of minor-closed graph properties. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 661-672, electronic only (2011).
3
Characterization of universal two-qubit Hamiltonians. (English)
Quantum Inf. Comput. 11, No. 1-2, 19-39 (2011).
4
Quantum property testing for bounded-degree graphs. (English)
Goldberg, Leslie Ann (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17‒19, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22934-3/pbk). Lecture Notes in Computer Science 6845, 365-376 (2011).
5
Simulating sparse Hamiltonians with star decompositions. (English)
van Dam, Wim (ed.) et al., Theory of quantum computation, communication, and cryptography. 5th conference, TQC 2010, Leeds, UK, April 13‒15, 2010. Revised selected papers. Berlin: Springer (ISBN 978-3-642-18072-9/pbk). Lecture Notes in Computer Science 6519, 94-103 (2011).
6
Characterization of universal two-qubit Hamiltonians (English)
Quantum Information & Computation 11, No. 1-2, 19-39 (2011).
7
Quantum query complexity of minor-closed graph properties (English)
STACS, 661-672 (2011).
8
Quantum property testing for bounded-degree graphs (English)
APPROX-RANDOM, 365-376 (2011).
9
Limitations on the simulation of non-sparse Hamiltonians. (English)
Quantum Inf. Comput. 10, No. 7-8, 669-684 (2010).
10
The quantum query complexity of certification. (English)
Quantum Inf. Comput. 10, No. 3-4, 181-189 (2010).
11
Quantum algorithms for algebraic problems. (English)
Rev. Mod. Phys. 82, No. 1, 1-52 (2010).
12
On the relationship between continuous- and discrete-time quantum walk. (English)
Commun. Math. Phys. 294, No. 2, 581-603 (2010).
13
Any AND-OR formula of size $N$ can be evaluated in time $N^{1/2+o(1)}$ on a quantum computer. (English)
SIAM J. Comput. 39, No. 6, 2513-2530 (2010).
14
The quantum query complexity of certification (English)
Quantum Information & Computation 10, No. 3-4, 181-189 (2010).
15
Limitations on the simulation of non-sparse Hamiltonians (English)
Quantum Information & Computation 10, No. 7-8, 669-684 (2010).
16
Simulating sparse Hamiltonians with star decompositions (English)
TQC, 94-103 (2010).
17
Discrete-query quantum algorithm for NAND trees. (English)
Theory Comput. 5, Paper No. 5, 119-123, electronic only (2009).
18
The quantum query complexity of certification. (English)
Comput. Res. Repos. 2009, Article No. 0903.1291 (2009).
19
Theory of quantum computation, communication, and cryptography. 4th workshop, TQC 2009, Waterloo, Canada, May 11‒13, 2009. Revised selected papers. (English)
Lecture Notes in Computer Science 5906. Berlin: Springer (ISBN 978-3-642-10697-2/pbk). vii, 107~p. EUR~49.22 (2009).
20
Result 1 to 20 of 58 total
Start
Contact
Print
General Help
