activity
20222026
most citedClifford Dressed Time-Dependent Variational Principle

20 citations · 100 across the 22 of their papers we have counts for

collaborators
Showing 2024Show all

8 papers · 1 filter

quant-ph2024★ 9 cited

The non-stabilizerness of fermionic Gaussian states

Mario Collura, Jacopo De Nardis, Vincenzo Alba +1

We introduce an efficient method to quantify nonstabilizerness in fermionic Gaussian states, overcoming the long-standing challenge posed by their extensive entanglement. Using a p…

quant-ph2024★ 15 cited

Anticoncentration and state design of random tensor networks

Guglielmo Lami, Jacopo De Nardis, Xhek Turkeshi

We investigate quantum random tensor network states where the bond dimensions scale polynomially with the system size, . Specifically, we examine the delocalization properties o…

quant-ph2024★ 20 cited

Clifford Dressed Time-Dependent Variational Principle

Antonio Francesco Mello, Alessandro Santini, Guglielmo Lami +2

We propose an enhanced Time-Dependent Variational Principle (TDVP) algorithm for Matrix Product States (MPS) that integrates Clifford disentangling techniques to efficiently manage…

quant-ph2024

Variational ground-state quantum adiabatic theorem

Bojan Žunkovič, Pietro Torta, Giovanni Pecci +2

We present a variational quantum adiabatic theorem, which states that, under certain assumptions, the adiabatic dynamics projected onto a variational manifold follow the instantane…

quant-ph2024★ 1 cited

Estimating Non-Stabilizerness Dynamics Without Simulating It

Alessio Paviglianiti, Guglielmo Lami, Mario Collura +1

We introduce the Iterative Clifford Circuit Renormalization (ICCR), a novel technique designed to efficiently handle the dynamics of non-stabilizerness (a.k.a. quantum magic) in ge…

quant-ph2024★ 2 cited

Quantum State Designs with Clifford Enhanced Matrix Product States

Guglielmo Lami, Tobias Haug, Jacopo De Nardis

Nonstabilizerness, or `magic', is a critical quantum resource that, together with entanglement, characterizes the non-classical complexity of quantum states. Here, we address the p…

quant-ph2024

Retrieving non-stabilizerness with Neural Networks

Antonio Francesco Mello, Guglielmo Lami, Mario Collura

Quantum computing's promise lies in its intrinsic complexity, with entanglement initially heralded as its hallmark. However, the quest for quantum advantage extends beyond entangle…

quant-ph2024★ 1 cited

Learning the stabilizer group of a Matrix Product State

Guglielmo Lami, Mario Collura

We present a novel classical algorithm designed to learn the stabilizer group -- namely the group of Pauli strings for which a state is a eigenvector -- of a given Matrix P…