3 citations · 3 across the 3 of their papers we have counts for
11 papers · 1 filter
A measurement-driven quantum algorithm for SAT: Performance guarantees via spectral gaps and measurement parallelization
Franz J. Schreiber, Maximilian J. Kramer, Alexander Nietner +1
The Boolean satisfiability problem (SAT) is of central importance in both theory and practice. Yet, most provable guarantees for quantum algorithms rely exclusively on Grover-type…
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…
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…
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…
Learning topological states from randomized measurements using variational tensor network tomography
Yanting Teng, Rhine Samajdar, Katherine Van Kirk +5
Learning faithful representations of quantum states is crucial to fully characterizing the variety of many-body states created on quantum processors. While various tomographic meth…
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…