-
Article
Complexity of Quantum Circuits via Sensitivity, Magic, and Coherence
Quantum circuit complexity—a measure of the minimum number of gates needed to implement a given unitary transformation—is a fundamental concept in quantum computation, with widespread applications ranging from...
-
Article
Open AccessClassical shadows with Pauli-invariant unitary ensembles
Classical shadows provide a noise-resilient and sample-efficient method for learning quantum system properties, relying on a user-specified unitary ensemble. What is the weakest assumption on this ensemble tha...
-
Article
Open AccessBarren plateaus from learning scramblers with local cost functions
The existence of barren plateaus has recently revealed new training challenges in quantum machine learning (QML). Uncovering the mechanisms behind barren plateaus is essential in understanding the scope of pro...
-
Article
Open AccessQuantifying scrambling in quantum neural networks
We quantify the role of scrambling in quantum machine learning. We characterize a quantum neural network’s (QNNs) error in terms of the network’s scrambling properties via the out-of-time-ordered correlator (O...
