Andris Ambainis
- 1.A. Ambainis. A better lower bound for quantum algorithms searching an ordered list. Proceedings of FOC$'99, pages 352-357. AlsoI quant-ph/9902053. Google Scholar
Digital Library
- 2.A. Ambainis, L. Schulman, A. Ta-Shma, U. Vazirani, A. Wigderson. Quantum communication complexity of sampling. Proceedings of FOC$'98, pages 342-351. Google ScholarDigital Library
- 3.R. Beals, H. Buhrman, R. Cleve, M. Mosca, R. de Wolf. Quantum lower bounds by polynomials. Proceedings of FOC$'98, pages 352-361. Also quant-ph/9802049. Google ScholarDigital Library
- 4.C. Bennett, E. Bernstein, G. Brassard, U. Vazirani. Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(3):1510-1523, 1997, quant-ph/9701001. Google ScholarDigital Library
- 5.G. Brassard, P. Heyer, and A. Tapp. Quantum algorithm for the collision problem. A CM $IGACT News (Cryptology Column), 28:14-19, 1997. quantph/9705002. Google ScholarDigital Library
- 6.H. Buhrman, R. Cleve, R. de Wolf, C. Zalka. Bounds for small-error and zero-error quantum algorithms. Proceedings of FOC$'99, pages 358-368. Also cs. CC/9904019. Google ScholarDigital Library
- 7.H. Buhrman, R. Cleve, A. Wigderson. Quantum vs. classical communication and computation. Proceedings of $TOC'98, pages 63-68. Also quant-ph/9802046. Google ScholarDigital Library
- 8.H. Buhrman, R. de Wolf. Communication complexity lower bounds by polynomials, cs. CC/9910010. Google ScholarDigital Library
- 9.L. Grover. A fast quantum mechanical algorithm for database search, Proceedings of the 28th A CM Symposium on Theory of Computing, pp. 212-219, 1996, quant-ph/9605043. Google ScholarDigital Library
- 10.L. Grover. How fast can a quantum computer search? quant-ph/9809029.Google Scholar
- 11.A. Yu. Kitaev. Quantum measurements and the Abelian stabilizer problem, quant-ph/9511026.Google Scholar
- 12.B. Kalyanasundaram, G. Schnitger. The probabilistic communication complexity of set intersection. Proceedings of Structures'87, pages 41-49, 1987.Google Scholar
- 13.A. Nayak and F. Wu. The quantum query complexity of approximating the median and related statistics. In Proceedings of 31th STOC, pages 384-393, 1999. Also quant-ph/9804066. Google ScholarDigital Library
- 14.N. Nisan. CREW PRAMs and decision trees. SIAM Journal on Computing, 20:999-1007, 1991. Also STOC'89. Google ScholarDigital Library
- 15.A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106:385-90, 1992. Also ICALP'90. Google ScholarDigital Library
- 16.Y. Shi. Lower bounds of quantum black-box complexity and degree of approximation polynomials by influence of Boolean variables, quant-ph/9904107. Google ScholarDigital Library
- 17.P. Shor. Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM journal on Computing. 26:1484-1509, 1997. Also FOCS'94. Google ScholarDigital Library
- 18.U. Vazirani. On the power of quantum computation. Philosophical Transactions of the Royal Society of London, Series A: Mathematical and Physical Sciences, 356:1759-1768, August 1998.Google ScholarCross Ref
Index Terms
- Quantum lower bounds by quantum arguments
Recommendations
Quantum lower bounds by quantum arguments
Special issue on STOC 2000We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with on input and then modifies the input, we use a quantum adversary that runs the algorithm with a superposition of ...
Non-monogamy of quantum discord and upper bounds for quantum correlation
We consider a monogamy inequality of quantum discord in a pure tripartite state and show that it is equivalent to an inequality between quantum mutual information and entanglement of formation of two parties. Since this inequality does not hold for ...
Lower bounds of concurrence for N-qubit systems and the detection of k-nonseparability of multipartite quantum systems
Concurrence, as one of the entanglement measures, is a useful tool to characterize quantum entanglement in various quantum systems. However, the computation of the concurrence involves difficult optimizations and only for the case of two qubits, an ...
Comments