most citedComputing quantum magic of state vectors

6 citations · 6 across the 5 of their papers we have counts for

collaborators

6 papers

quant-ph2026

Random Gaussian Augmented Matrix Product States

Stavya Puri, Poetri Sonya Tarabunga, Piotr Sierant

Strong entanglement limits the reach of tensor-network descriptions of quantum many-body systems. We study Gaussian-augmented matrix product states (GAMPS), formed by applying a fr…

quant-ph2026

Spectral geometry of nonlocal stabilizer entropy

Piotr Sierant

Magic, or nonstabilizerness, is the resource that promotes stabilizer operations to universal quantum computation. For bipartite pure states, its component intrinsic to the correla…

quant-ph2026

Exact quantification of nonlocal magic

Piotr Sierant

Magic, or nonstabilizerness, is the resource that lifts Clifford circuits to universal quantum computation and has become a standard diagnostic of many-body states. For a state sha…

quant-ph2026

Theory of Magic Phase Transitions in Encoding-Decoding Circuits

Piotr Sierant, Xhek Turkeshi

Quantum magic resources, or nonstabilizerness, are a central ingredient for universal quantum computation. In noisy many-body systems, the interplay between these resources and err…

quant-ph2026

Limits of Clifford Disentangling in Tensor Network States

Sergi Masot-Llima, Piotr Sierant, Paolo Stornati +1

Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handl…

quant-ph2026★ 6 cited

Computing quantum magic of state vectors

Piotr Sierant, Jofre Vallès-Muns, Artur Garcia-Saez

Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful prob…