Peter Høyer

Zhan Yu

Quantum Inf. Comput., 2020

Contextuality in multipartite pseudo-telepathy graph games.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2020

2019

Key Establishment à la Merkle in a Quantum World.

[BibT_eX]

[DOI]

J. Cryptol., 2019

2017

Provably Secure Key Establishment Against Quantum Adversaries.

[BibT_eX]

[DOI]

Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

Efficient Quantum Walk on the Grid with Multiple Marked Elements.

[BibT_eX]

[DOI]

Mojtaba Komeili

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Controlled Quantum Amplification.

[BibT_eX]

[DOI]

Catalin Dohotaru

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Quantum Algorithm for the Collision Problem.

[BibT_eX]

[DOI]

Alain Tapp

Encyclopedia of Algorithms, 2016

Quantum computation with coherent spin states and the close Hadamard problem.

[BibT_eX]

[DOI]

Mark Adcock

Barry C. Sanders

Quantum Inf. Process., 2016

Contextuality in multipartie pseudo-telepathy graph games.

[BibT_eX]

[DOI]

Mehdi Mhalla

Simon Perdrix

CoRR, 2016

2014

Polynomial time quantum algorithms for certain bivariate hidden polynomial problems.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2014

2013

Gaussian quantum computation with oracle-decision problems.

[BibT_eX]

[DOI]

Mark Adcock

Barry C. Sanders

Quantum Inf. Process., 2013

2011

Merkle Puzzles in a Quantum World.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2009

Exact quantum lower bound for grover's problem.

[BibT_eX]

[DOI]

Catalin Dohotaru

Quantum Inf. Comput., 2009

2007

Negative weights make adversaries stronger.

[BibT_eX]

[DOI]

Troy Lee

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Quantum Query Complexity of Some Graph Problems.

[BibT_eX]

[DOI]

SIAM J. Comput., 2006

Resources Required for Preparing Graph States.

[BibT_eX]

[DOI]

Mehdi Mhalla

Simon Perdrix

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Quantum Fan-out is Powerful.

[BibT_eX]

[DOI]

Theory Comput., 2005

Quantum Algorithms for Element Distinctness.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Lower Bounds on Quantum Query Complexity.

[BibT_eX]

Bull. EATCS, 2005

The Phase Matrix.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004

The quantum query complexity of the hidden subgroup problem is polynomial.

[BibT_eX]

[DOI]

Mark Ettinger

Emanuel Knill

Inf. Process. Lett., 2004

Consequences and Limits of Nonlocal Strategies.

[BibT_eX]

[DOI]

Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003

Quantum Circuits with Unbounded Fan-out.

[BibT_eX]

[DOI]

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Quantum Search on Bounded-Error Inputs.

[BibT_eX]

[DOI]

Michele Mosca

Ronald de Wolf

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness.

[BibT_eX]

[DOI]

Jan Neerbek

Yaoyun Shi

Algorithmica, 2002

Improved Quantum Communication Complexity Bounds for Disjointness and Equality.

[BibT_eX]

[DOI]

Ronald de Wolf

Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2001

Introduction to Recent Quantum Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

Simplified proof of the Fourier Sampling Theorem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

On Quantum Algorithms for Noncommutative Hidden Subgroups.

[BibT_eX]

[DOI]

Mark Ettinger

Adv. Appl. Math., 2000

1998

Parametric Permutation Routing via Matchings.

[BibT_eX]

Kim S. Larsen

Nord. J. Comput., 1998

Quantum Counting.

[BibT_eX]

[DOI]

Alain Tapp

Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997

Quantum cryptanalysis of hash and claw-free functions.

[BibT_eX]

[DOI]

Alain Tapp

SIGACT News, 1997

An Exact Quantum Polynomial-Time Algorithm for Simon's Problem.

[BibT_eX]

[DOI]

Proceedings of the Fifth Israel Symposium on Theory of Computing and Systems, 1997

1996

A Quantum Algorithm for Finding the Minimum

[BibT_eX]

[DOI]

Christoph Dürr

CoRR, 1996

1995

A General Technique for Implementation of Efficient Priority Queues.

[BibT_eX]

[DOI]