Linear growth of quantum circuit complexity
The complexity of quantum states has become a key quantity of interest across various
subfields of physics, from quantum computing to the theory of black holes. The evolution of …
subfields of physics, from quantum computing to the theory of black holes. The evolution of …
Spread complexity and topological transitions in the Kitaev chain
A bstract A number of recent works have argued that quantum complexity, a well-known
concept in computer science that has re-emerged recently in the context of the physics of …
concept in computer science that has re-emerged recently in the context of the physics of …
Resource theory of quantum scrambling
Quantum chaos has become a cornerstone of physics through its many applications. One
trademark of quantum chaotic systems is the spread of local quantum information, which …
trademark of quantum chaotic systems is the spread of local quantum information, which …
A compendious review of majorization-based resource theories: quantum information and quantum thermodynamics
The field of quantum resource theory (QRT) has emerged as an invaluable framework for the
examination of small and strongly correlated quantum systems, surpassing the boundaries …
examination of small and strongly correlated quantum systems, surpassing the boundaries …
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 …
implement a given unitary transformation—is a fundamental concept in quantum …
Magic of random matrix product states
Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states,
making it an important resource in quantum computing, under the formalism of the Gotteman …
making it an important resource in quantum computing, under the formalism of the Gotteman …
Quantum complexity phase transitions in monitored random circuits
R Suzuki, J Haferkamp, J Eisert, P Faist - ar** via uncomplexity
Efficiently map** quantum circuits onto hardware is integral for the quantum compilation
process, wherein a circuit is modified in accordance with a quantum processor's …
process, wherein a circuit is modified in accordance with a quantum processor's …
On the moments of random quantum circuits and robust quantum complexity
J Haferkamp - arxiv preprint arxiv:2303.16944, 2023 - arxiv.org
We prove new lower bounds on the growth of robust quantum circuit complexity--the minimal
number of gates $ C_ {\delta}(U) $ to approximate a unitary $ U $ up to an error of $\delta …
number of gates $ C_ {\delta}(U) $ to approximate a unitary $ U $ up to an error of $\delta …