113 citations · 202 across the 13 of their papers we have counts for
13 papers · 1 filter
Clifford testing: algorithms and lower bounds
Marcel Hinsche, Zongbo Bao, Philippe van Dordrecht +3
We consider the problem of Clifford testing, which asks whether a black-box -qubit unitary is a Clifford unitary or at least -far from every Clifford unitary. We gi…
Will it glue? On short-depth designs beyond the unitary group
Lorenzo Grevink, Jonas Haferkamp, Markus Heinrich +4
We study the formation of short-depth designs beyond the unitary group. We provide a range of results on several groups of broad interest in quantum information science: the Cliffo…
The abelian state hidden subgroup problem: Learning stabilizer groups and beyond
Marcel Hinsche, Jens Eisert, Jose Carrasco
Identifying the symmetry properties of quantum states is a central theme in quantum information theory and quantum many-body physics. In this work, we investigate quantum learning…
Dynamic parameterized quantum circuits: expressive and barren-plateau free
Abhinav Deshpande, Marcel Hinsche, Khadijeh Najafi +3
Classical optimization of parameterized quantum circuits is a widely studied methodology for the preparation of complex quantum states, as well as the solution of machine learning…
Single-copy stabilizer testing
Marcel Hinsche, Jonas Helsen
We consider the problem of testing whether an unknown -qubit quantum state is a stabilizer state, with only single-copy access. We give an algorithm solving this pro…
Interactive proofs for verifying (quantum) learning and testing
Matthias C. Caro, Jens Eisert, Marcel Hinsche +3
We consider the problem of testing and learning from data in the presence of resource constraints, such as limited memory or weak data access, which place limitations on the effici…
Efficient distributed inner product estimation via Pauli sampling
Marcel Hinsche, Marios Ioannou, Sofiene Jerbi +3
Cross-platform verification is the task of comparing the output states produced by different physical platforms using solely local quantum operations and classical communication. W…
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…
Classical Verification of Quantum Learning
Matthias C. Caro, Marcel Hinsche, Marios Ioannou +2
Quantum data access and quantum processing can make certain classically intractable learning tasks feasible. However, quantum capabilities will only be available to a select few in…
On the average-case complexity of learning output distributions of quantum circuits
Alexander Nietner, Marios Ioannou, Ryan Sweke +4
In this work, we show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model. This learning model is widely…
Shallow shadows: Expectation estimation using low-depth random Clifford circuits
Christian Bertoni, Jonas Haferkamp, Marcel Hinsche +3
We provide practical and powerful schemes for learning many properties of an unknown n-qubit quantum state using a sparing number of copies of the state. Specifically, we present a…
Learnability of the output distributions of local quantum circuits
Marcel Hinsche, Marios Ioannou, Alexander Nietner +6
There is currently a large interest in understanding the potential advantages quantum devices can offer for probabilistic modelling. In this work we investigate, within two differe…
Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
Abhinav Deshpande, Arthur Mehta, Trevor Vincent +10
Photonics is a promising platform for demonstrating a quantum computational advantage (QCA) by outperforming the most powerful classical supercomputers on a well-defined computatio…