145 citations · 748 across the 17 of their papers we have counts for
17 papers
Verifiable measurement-based quantum random sampling with trapped ions
Martin Ringbauer, Marcel Hinsche, Thomas Feldker +13
Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling…
Equivalence of contextuality and Wigner function negativity in continuous-variable quantum optics
Jonas Haferkamp, Juani Bermejo-Vega
One of the central foundational questions of physics is to identify what makes a system quantum as opposed to classical. One seminal notion of classicality of a quantum system is t…
Quantum advantage from energy measurements of many-body quantum systems
Leonardo Novo, Juani Bermejo-Vega, Raúl García-Patrón
The problem of sampling outputs of quantum circuits has been proposed as a candidate for demonstrating a quantum computational advantage (sometimes referred to as quantum "supremac…
Dynamical structure factors of dynamical quantum simulators
Maria Laura Baez, Marcel Goihl, Jonas Haferkamp +3
The dynamical structure factor is one of the experimental quantities crucial in scrutinizing the validity of the microscopic description of strongly correlated systems. However, de…
Closing gaps of a quantum advantage with short-time Hamiltonian dynamics
Jonas Haferkamp, Dominik Hangleiter, Adam Bouland +3
Demonstrating a quantum computational speedup is a crucial milestone for near-term quantum technology. Recently, quantum simulation architectures have been proposed that have the p…
Phase space simulation method for quantum computation with magic states on qubits
Robert Raussendorf, Juani Bermejo-Vega, Emily Tyhurst +2
We propose a method for classical simulation of finite-dimensional quantum systems, based on sampling from a quasiprobability distribution, i.e., a generalized Wigner function. Our…
Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
David T. Stephen, Hendrik Poulsen Nautrup, Juani Bermejo-Vega +2
Quantum phases of matter are resources for notions of quantum computation. In this work, we establish a new link between concepts of quantum information theory and condensed matter…
Anticoncentration theorems for schemes showing a quantum speedup
Dominik Hangleiter, Juan Bermejo-Vega, Martin Schwarz +1
One of the main milestones in quantum information science is to realise quantum devices that exhibit an exponential computational advantage over classical ones without being univer…
Architectures for quantum simulation showing a quantum speedup
J. Bermejo-Vega, D. Hangleiter, M. Schwarz +2
One of the main aims in the field of quantum simulation is to achieve a quantum speedup, often referred to as "quantum computational supremacy", referring to the experimental reali…
Normalizer Circuits and Quantum Computation
Juan Bermejo-Vega
(Abridged abstract.) In this thesis we introduce new models of quantum computation to study the emergence of quantum speed-up in quantum computer algorithms. Our first contribution…
Equivalence between contextuality and negativity of the Wigner function for qudits
Nicolas Delfosse, Cihan Okay, Juan Bermejo-Vega +2
Contextuality and negativity of the Wigner function are two notions of non-classicality for quantum systems. Howard, Wallman, Veitch and Emerson proved recently that these two noti…
Contextuality as a resource for models of quantum computation on qubits
Juan Bermejo-Vega, Nicolas Delfosse, Dan E. Browne +2
A central question in quantum computation is to identify the resources that are responsible for quantum speed-up. Quantum contextuality has been recently shown to be a resource for…
Contextuality and Wigner function negativity in qubit quantum computation
Robert Raussendorf, Dan E. Browne, Nicolas Delfosse +2
We describe a scheme of quantum computation with magic states on qubits for which contextuality is a necessary resource possessed by the magic states. More generally, we establish…
Abelian Hypergroups and Quantum Computation
Juan Bermejo-Vega, Kevin C. Zatloukal
Motivated by a connection, described here for the first time, between the hidden normal subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions of…
The computational power of normalizer circuits over black-box groups
Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest
This work presents a precise connection between Clifford circuits, Shor's factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for sol…
Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems
Juan Bermejo-Vega, Cedric Yen-Yu Lin, Maarten Van den Nest
[1,2] are generalized Clifford circuits that act on arbitrary finite-dimensional systems wit…
Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Juan Bermejo-Vega, Maarten Van den Nest
Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits [arXiv:1201.4867]: a normalizer circuit over a finite Abelian group is composed of…