157 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Centrum Wiskunde & InformaticaNL18 papers
- University of AmsterdamNL10 papers
- QuSoftNL7 papers
- Centre National de la Recherche ScientifiqueFR4 papers
- Delft University of TechnologyNL3 papers
- University of TwenteNL3 papers
- University of WaterlooCA3 papers
- Vrije Universiteit AmsterdamNL3 papers
- California Institute of TechnologyUS2 papers
- Département d'InformatiqueFR2 papers
- Eindhoven University of TechnologyNL2 papers
- ETH ZurichCH2 papers
16 papers · 1 filter
Anticoncentration is (almost) all you need
Markus Heinrich, Jonas Haferkamp, Ingo Roth +1
Until very recently, it was generally believed that the (approximate) 2-design property is strictly stronger than anticoncentration of random quantum circuits, mainly because it wa…
Phase estimation with partially randomized time evolution
Jakob Günther, Freek Witteveen, Alexander Schmidhuber +3
Quantum phase estimation combined with Hamiltonian simulation is the most promising algorithmic framework to computing ground state energies on quantum computers. Its main computat…
Provable and Verifiable Quantum Advantage in Sample Complexity
Marcello Benedetti, Harry Buhrman, Jordi Weggemans
Consider a fixed universe of elements and the uniform distribution over elements of some subset of size . Given samples from this distribution, the task of complement sa…
Solving Free Fermion Problems on a Quantum Computer
Maarten Stroeks, Daan Lenterman, Barbara Terhal +1
Simulating noninteracting fermion systems is a common task in computational many-body physics. In absence of translational symmetries, modeling free fermions on modes usually r…
Distinguishing Graph States by the Properties of Their Marginals
Lina Vandré, Jarn de Jong, Frederik Hahn +3
Graph states are a class of multi-partite entangled quantum states that are ubiquitous in quantum information. We study equivalence relations between graph states under local unita…
Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
Antonio Anna Mele, Yaroslav Herasymenko
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum…
Global Variational Quantum Circuits for Arbitrary Symmetric State Preparation
Liam J. Bond, Matthew J. Davis, Jiří Minář +3
Quantum states that are symmetric under particle exchange play a crucial role in fields such as quantum metrology and quantum error correction. We use a variational circuit compose…
Robust Cryptography in the Noisy-Quantum-Storage Model
Christian Schaffner, Barbara Terhal, Stephanie Wehner
It was shown in [WST08] that cryptographic primitives can be implemented based on the assumption that quantum storage of qubits is noisy. In this work we analyze a protocol for the…
Locally Decodable Quantum Codes
Jop Briët, Ronald de Wolf
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that e…
The quantum moment problem and bounds on entangled multi-prover games
Andrew C. Doherty, Yeong-Cherng Liang, Ben Toner +1
We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state rho and a collection o…
New Limits on Fault-Tolerant Quantum Computation
Harry Buhrman, Richard Cleve, Monique Laurent +3
We show that quantum circuits cannot be made fault-tolerant against a depolarizing noise level of approximately 45%, thereby improving on a previous bound of 50% (due to Razborov).…
Quantum Algorithms for Matching and Network Flows
Andris Ambainis, Robert Spalek
We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time…
Tight adversary bounds for composite functions
Peter Hoyer, Troy Lee, Robert Spalek
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many…
All Quantum Adversary Methods are Equivalent
Robert Spalek, Mario Szegedy
The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spectral advers…
Quantum and Classical Strong Direct Product Theorems and Optimal Time-Space Tradeoffs
Hartmut Klauck, Robert Spalek, Ronald de Wolf
A strong direct product theorem says that if we want to compute k independent instances of a function, using less than k times the resources needed for one instance, then our overa…
Robust Polynomials and Quantum Algorithms
Harry Buhrman, Ilan Newman, Hein Roehrig +1
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We co…