Barren plateaus from learning scramblers with local cost functions

Garcia, Roy J.; Chen, Zhao; Bu, Kaifeng; Jaffe, Arthur

doi:10.48550/arxiv.2205.06679

Cited by 1 publication

(1 citation statement)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can therefore see that small temporal entanglement fluctuations and complexity of entanglement are two aspects of the same thing, namely the entanglement complexity driven by the doping of non-Clifford gates that are spreading in the system. Additionally, one can draw a direct connection between the results put forth here and recent studies of barren plateaus in quantum machine learning [59][60][61][62]. In particular, the complexity transitions explored in this work reveal that the flattening of our training landscape (i.e.…”

Section: Results and Analysissupporting

confidence: 66%

Transitions in Entanglement Complexity in Random Circuits

True

Hamma

2022

Quantum

View full text Add to dashboard Cite

Entanglement is the defining characteristic of quantum mechanics. Bipartite entanglement is characterized by the von Neumann entropy. Entanglement is not just described by a number, however; it is also characterized by its level of complexity. The complexity of entanglement is at the root of the onset of quantum chaos, universal distribution of entanglement spectrum statistics, hardness of a disentangling algorithm and of the quantum machine learning of an unknown random circuit, and universal temporal entanglement fluctuations. In this paper, we numerically show how a crossover from a simple pattern of entanglement to a universal, complex pattern can be driven by doping a random Clifford circuit with T gates. This work shows that quantum complexity and complex entanglement stem from the conjunction of entanglement and non-stabilizer resources, also known as magic.

show abstract

Section: Results and Analysissupporting

confidence: 66%