6 citations · 11 across the 8 of their papers we have counts for
9 papers
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…
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…
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…
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…
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…
A Primer on Quantum Machine Learning
Su Yeon Chang, M. Cerezo
Quantum machine learning (QML) is a computational paradigm that seeks to apply quantum-mechanical resources to solve learning problems. As such, the goal of this framework is to le…
Moments of Quantum Channel Ensembles
Matthew Duschenes, Diego García-Martín, Zoë Holmes +1
Moments of ensembles of unitaries play a central role in quantum information theory as they capture the statistical properties of dynamics of systems with some form of randomness.…
Simulating quantum circuits with arbitrary local noise using Pauli Propagation
Armando Angrisani, Antonio A. Mele, Manuel S. Rudolph +2
We present a polynomial-time classical algorithm for estimating expectation values of arbitrary observables on typical quantum circuits under any incoherent local noise, including…
Efficient quantum-enhanced classical simulation for patches of quantum landscapes
Sacha Lerch, Ricard Puig, Manuel S. Rudolph +5
Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous. Not only does this ensure that quantum computers are…