19 papers
Learning complexity gradually in quantum machine learning models
Erik Recio-Armengol, Franz J. Schreiber, Jens Eisert +1
Quantum machine learning is an emergent field that continues to draw significant interest for its potential to offer improvements over classical algorithms in certain areas. Howeve…
A complete theory of the Clifford commutant
Lennart Bittel, Jens Eisert, Lorenzo Leone +2
The Clifford group plays a central role in quantum information science. It is the building block for many error-correcting schemes and matches the first three moments of the Haar m…
Noise-induced shallow circuits and absence of barren plateaus
Antonio Anna Mele, Armando Angrisani, Soumik Ghosh +4
Motivated by realistic hardware considerations of the pre-fault-tolerant era, we comprehensively study the impact of uncorrected noise on quantum circuits. We first show that in th…
How hard is it to verify a classical shadow?
Georgios Karaiskos, Dorian Rudolph, Johannes Jakob Meyer +2
Classical shadows are succinct classical representations of quantum states which allow one to encode a set of properties P of a quantum state rho, while only requiring measurements…
Using deep learning to construct stochastic local search SAT solvers with performance bounds
Maximilian J. Kramer, Paul Boes, Jens Eisert
The Boolean Satisfiability problem (SAT), as the prototypical -complete problem, is crucial in both theoretical computer science and practical applications. To address…
Computational relative entropy
Johannes Jakob Meyer, Asad Raza, Jacopo Rizzo +3
Our capacity to process information depends on the computational power at our disposal. Information theory captures our ability to distinguish states or communicate messages when i…