113 citations · 219 across the 11 of their papers we have counts for
11 papers
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…
Benchmarking bosonic and fermionic dynamics
Jadwiga Wilkens, Marios Ioannou, Ellen Derbyshire +4
Analog quantum simulation allows for assessing static and dynamical properties of strongly correlated quantum systems to high precision. To perform simulations outside the reach of…
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…
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…
Estimating gate-set properties from random sequences
J. Helsen, M. Ioannou, J. Kitzinger +4
With quantum computing devices increasing in scale and complexity, there is a growing need for tools that obtain precise diagnostic information about quantum operations. However, c…
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…
Termwise versus globally stoquastic local Hamiltonians: questions of complexity and sign-curing
Marios Ioannou, Stephen Piddock, Milad Marvian +2
We elucidate the distinction between global and termwise stoquasticity for local Hamiltonians and prove several complexity results. We show that the stoquastic local Hamiltonian pr…
Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
Joel Klassen, Milad Marvian, Stephen Piddock +3
We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamilton…