| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andris Ambainis, Abuzer Yakaryilmaz |
Superiority of exact quantum automata for promise problems.  |
Inf. Process. Lett.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Variable time amplitude amplification and quantum algorithms for linear algebra problems. |
STACS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Xiaoming Sun |
New separation between s(f) and bs(f). |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Arturs Backurs, Nikolajs Nahimovs, Raitis Ozols, Alexander Rivosh |
Search by quantum walks on two-dimensional grid without amplitude amplification |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Xiaoming Sun |
New separation between $s(f)$ and $bs(f)$ |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Arturs Backurs, Kaspars Balodis, Dmitry Kravchenko, Raitis Ozols, Juris Smotrovs, Madars Virza |
Quantum strategies are better than classical in almost any XOR game |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Finite Automata. |
NCMA |
2011 |
DBLP 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 | Scott Aaronson, Andris Ambainis |
The Need for Structure in Quantum Speedups. |
ICS |
2011 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland |
Symmetry-Assisted Adversaries for Quantum State Generation. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland |
Symmetry-assisted adversaries for quantum state generation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
A New Quantum Lower Bound Method, with an Application to a Strong Direct Product Theorem for Quantum Search. |
Theory of Computing |
2010 |
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 | Andris Ambainis |
Limits on entropic uncertainty relations. |
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 | Andris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland |
Symmetry-assisted adversaries for quantum state generation |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
New Developments in Quantum Algorithms |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum algorithms for formula evaluation |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Search with Variable Times. |
Theory Comput. Syst. |
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 | Andris Ambainis |
Quantum algorithms for formula evaluation. |
Quantum Cryptography and Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh |
Nonlocal Quantum XOR Games for Large Number of Players. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
New Developments in Quantum Algorithms. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Julia Kempe, Or Sattath |
A quantum lovász local lemma. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
local lemma, quanum SAT, random quantum sat, quantum computation, probabilistic method |
| 1 | Scott Aaronson, Andris Ambainis |
The Need for Structure in Quantum Speedups. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Nikolajs Nahimovs |
Improved constructions of quantum automata. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Quantum lower bounds, Boolean functions, Quantum computing, Quantum algorithms, Time-space tradeoffs |
| 1 | Scott Aaronson, Andris Ambainis |
The Need for Structure in Quantum Speedups |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita |
Average/Worst-Case Gap of Quantum Query Complexities by On-Set Size |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Julia Kempe, Or Sattath |
A Quantum Lovasz Local Lemma |
CoRR |
2009 |
DBLP 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 | Andris Ambainis |
Probabilistic and team PFIN-type learning: General properties. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Algorithm for Search on Grids. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Algorithm for Element Distinctness. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum search with variable times. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Nikolajs Nahimovs |
Improved Constructions of Quantum Automata. |
TQC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Alexander Rivosh |
Quantum Walks with Multiple or Moving Marked Locations. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Random Walks - New Method for Designing Quantum Algorithms. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Kazuo Iwama, Masaki Nakanishi, Harumichi Nishimura, Rudy Raymond, Seiichiro Tani, Shigeru Yamashita |
Quantum Query Complexity of Boolean Functions with Small On-Sets. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Joseph Emerson |
Quantum t-designs: t-wise independence in the quantum world. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond, Shigeru Yamashita |
Improved algorithms for quantum identification of Boolean oracles. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Walk Algorithm for Element Distinctness. |
SIAM J. Comput. |
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 | Andris Ambainis, Joseph Emerson |
Quantum t-designs: t-wise Independence in the Quantum World. |
IEEE Conference on Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Leonard J. Schulman, Umesh V. Vazirani |
Computing with highly mixed states. |
J. ACM |
2006 |
DBLP DOI BibTeX RDF |
Quantum Computation |
| 1 | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien |
Algebraic Results on Quantum Automata. |
Theory Comput. Syst. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Polynomial degree vs. quantum query complexity. |
J. Comput. Syst. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Daniel Gottesman |
The minimum distance problem for two-way entanglement purification. |
IEEE Transactions on Information Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek |
Quantum Algorithms for Matching and Network Flows. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Rudy Raymond Harry Putra, Shigeru Yamashita |
Improved Algorithms for Quantum Identification of Boolean Oracles. |
SWAT |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower Bounds on the Deterministic and Quantum Communication Complexities of Hamming-Distance Problems. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A new quantum lower bound method, : with applications to direct product theorems and time-space tradeoffs. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
lower bounds, quantum computing, time-space tradeoffs, direct product theorems |
| 1 | Scott Aaronson, Andris Ambainis |
Quantum Search of Spatial Regions. |
Theory of Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Polynomial Degree and Lower Bounds in Quantum Complexity: Collision and Element Distinctness with Small Range. |
Theory of Computing |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Probabilistic and Team PFIN-type Learning: General Properties |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Robert Spalek, Ronald de Wolf |
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
A new quantum lower bound method, with an application to strong direct product theorem for quantum search |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum search algorithms |
CoRR |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Julia Kempe, Alexander Rivosh |
Coins make quantum walks faster. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower bounds on the Deterministic and Quantum Communication Complexity of HAMna |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, John Case, Sanjay Jain, Mandayam Suraj |
Parsimony hierarchies for inductive inference. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Yaoyun Shi |
Distributed construction of quantum fingerprints. |
Quantum Information & Computation |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, William I. Gasarch, Aravind Srinivasan, Andrey Utis |
Lower bounds on the Deterministic and Quantum Communication Complexity of Hamming Distance |
CoRR |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum search algorithms. |
SIGACT News |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
A new protocol and lower bounds for quantum coin flipping. |
J. Comput. Syst. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Kazuo Iwama, Akinori Kawachi, Hiroyuki Masuda, Raymond H. Putra, Shigeru Yamashita |
Quantum Identification of Boolean Oracles. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Martin Beaudry, Marats Golovkins, Arnolds Kikusts, Mark Mercer, Denis Thérien |
Algebraic Results on Quantum Automata. |
STACS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Markus Jakobsson, Helger Lipmaa |
Cryptographic Randomized Response Techniques. |
Public Key Cryptography |
2004 |
DBLP DOI BibTeX RDF |
randomized response technique, privacy, privacy-preserving data-mining, oblivious transfer, polling, binary symmetric channel |
| 1 | Andris Ambainis, Adam Smith |
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Walk Algorithm for Element Distinctness. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ke Yang |
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig |
Multiparty Quantum Coin Flipping. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum algorithms a decade after shor. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Ke Yang |
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Arnolds Kikusts |
Exact results for accepting probabilities of quantum automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Markus Jakobsson, Helger Lipmaa |
Cryptographic Randomized Response Techniques. |
IACR Cryptology ePrint Archive |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, Hein Röhrig |
Multiparty Quantum Coin Flipping |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Polynomial degree vs. quantum query complexity |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Markus Jakobsson, Helger Lipmaa |
Cryptographic Randomized Response Techniques |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shma, Umesh V. Vazirani, Avi Wigderson |
The Quantum Communication Complexity of Sampling. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Uldis Barbans, Agnese Belousova, Aleksandrs Belovs, Ilze Dzelme, Girts Folkmanis, Rusins Freivalds, Peteris Ledins, Rihards Opmanis, Agnis Skuskovniks |
Size of Quantum Versus Deterministic Finite Automata. |
VLSI |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Polynomial Degree vs. Quantum Query Complexity. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson, Andris Ambainis |
Quantum Search of Spatial Regions. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, John Watrous |
Two-way finite automata with quantum and classical state. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Stephen A. Bloch, David L. Schweizer |
Delayed Binary Search, or Playing Twenty Questions with a Procrastinator. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Fibonacci series, Golden Ratio, Monotone search, Delay, Binary search |
| 1 | Andris Ambainis, Ashwin Nayak, Amnon Ta-Shma, Umesh V. Vazirani |
Dense quantum coding and quantum finite automata. |
J. ACM |
2002 |
DBLP DOI BibTeX RDF |
Automaton size, quantum computation, encoding, communication complexity, finite automata, quantum communication |
| 1 | Benjamin C. Travaglione, Michael A. Nielsen, Howard M. Wiseman, Andris Ambainis |
ROM-based computation: quantum versus classical. |
Quantum Information & Computation |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis |
Quantum Lower Bounds by Quantum Arguments. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Adam Smith, Ke Yang |
Extracting Quantum Entanglement. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Entanglement Purification, General Error Models, Purity-Testing, Quantum Cryptography |
| 1 | Andris Ambainis |
On learning formulas in the limit and with assurance. |
Inf. Process. Lett. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet |
The Communication Complexity of Enumeration, Elimination, and Selection |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andris Ambainis, Kalvis Apsitis, Rusins Freivalds, Carl H. Smith |
Hierarchies of probabilistic and team FIN-learning. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
Probabilistic inductive inference: a survey. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Harry Buhrman, William I. Gasarch, Bala Kalyanasundaram, Leen Torenvliet |
The Communication Complexity of Enumeration, Elimination, and Selection. |
J. Comput. Syst. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Arnolds Kikusts |
Exact Results for Accepting Probabilities of Quantum Automata. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Arnolds Kikusts, Maris Valdats |
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorit Aharonov, Andris Ambainis, Julia Kempe, Umesh V. Vazirani |
Quantum walks on graphs. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis |
A new protocol and lower bounds for quantum coin flipping. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous |
One-dimensional quantum walks. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")