activity
20242026
most citedSimulating quantum circuits with arbitrary local noise using Pauli Propagation

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

collaborators
Showing 2026Show all

5 papers · 1 filter

quant-ph2026

Optimal four-copy detection of the three-tangle and its fault-tolerant cost

Federico Tomás B. Pérez, Berta Casas, I-Chi Chen +3

The three-tangle, , is a measure of genuine tripartite entanglement that distinguishes GHZ-type from W-type entanglement in pure three-qubit states. Here, we identify the stat…

quant-ph2026

The cost of simulating classically tractable quantum circuits and dynamics

Su Yeon Chang, Supanut Thanasilp, Zoë Holmes +1

Determining whether a quantum evolution can be efficiently simulated classically is central to understanding the boundary between classical and quantum computation. However, polyno…

quant-ph2026

Flood of multipartite Rains entanglement

Hailey S. Murray, Sagnik Bhattacharya, M. Cerezo +2

Multipartite entanglement admits phenomena such as the activation of genuine multipartite entanglement (GME) and the existence of inequivalent classes of entanglement, and existing…

quant-ph2026

Genuine multipartite Rains entanglement

Hailey S. Murray, Sagnik Bhattacharya, M. Cerezo +2

We introduce the genuine multipartite Rains entanglement (GMRE) as a measure of genuine multipartite entanglement that can be computed using semi-definite programming. Similar to t…

quant-ph2026

Matchgate synthesis via Clifford matchgates and gates

Berta Casas, Paolo Braccia, Élie Gouzien +2

Matchgate unitaries are ubiquitous in quantum computation due to their relation to non-interacting fermions and because they can be used to benchmark quantum computers. Implementin…