77 citations · 182 across the 15 of their papers we have counts for
16 papers
PauLie: Fast Classification of Pauli Dynamical Lie Algebras
Oxana Shaya, Konstantin Golovkin, Mainak Roy +1
The dynamical Lie algebra (DLA) governs the controllability, expressibility, and simulation complexity of a quantum system. Explicitly computing it has been a major computational b…
Increasing the Measured Effective Quantum Volume with Zero Noise Extrapolation
Elijah Pelofske, Vincent Russo, Ryan LaRose +5
Quantum Volume is a full-stack benchmark for near-term quantum computers. It quantifies the largest size of a square circuit which can be executed on the target device with reasona…
Schrödinger as a Quantum Programmer: Estimating Entanglement via Steering
Aby Philip, Soorya Rethinasamy, Vincent Russo +1
Quantifying entanglement is an important task by which the resourcefulness of a quantum state can be measured. Here, we develop a quantum algorithm that tests for and quantifies th…
Testing platform-independent quantum error mitigation on noisy quantum computers
Vincent Russo, Andrea Mari, Nathan Shammah +2
We apply quantum error mitigation techniques to a variety of benchmark problems and quantum computers to evaluate the performance of quantum error mitigation in practice. To do so,…
A note on the inner products of pure states and their antidistinguishability
Vincent Russo, Jamie Sikora
A set of d quantum states is said to be antidistinguishable if there exists a d-outcome POVM that can perfectly identify which state was not measured. A conjecture by Havlíček and…
Arkhipov's theorem, graph minors, and linear system nonlocal games
Connor Paddock, Vincent Russo, Turner Silverthorne +1
The perfect quantum strategies of a linear system game correspond to certain representations of its solution group. We study the solution groups of graph incidence games, which are…
Error mitigation increases the effective quantum volume of quantum computers
Ryan LaRose, Andrea Mari, Vincent Russo +2
Quantum volume is a single-number metric which, loosely speaking, reports the number of usable qubits on a quantum computer. While improvements to the underlying hardware are a dir…
Entanglement cost of discriminating noisy Bell states by local operations and classical communication
Somshubhro Bandyopadhyay, Vincent Russo
Entangled states can help in quantum state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfect…
Extended Nonlocal Games from Quantum-Classical Games
Vincent Russo, John Watrous
Several variants of nonlocal games have been considered in the study of quantum entanglement and nonlocality. This paper concerns two of these variants, called quantum-classical ga…
Extended Nonlocal Games
Vincent Russo
The notions of entanglement and nonlocality are among the most striking ingredients found in quantum information theory. One tool to better understand these notions is the model of…
Extended nonlocal games and monogamy-of-entanglement games
Nathaniel Johnston, Rajat Mittal, Vincent Russo +1
We study a generalization of nonlocal games---which we call extended nonlocal games---in which the players, Alice and Bob, initially share a tripartite quantum state with the refer…
Limitations on separable measurements by convex optimization
Somshubhro Bandyopadhyay, Alessandro Cosentino, Nathaniel Johnston +3
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include…
Is absolute separability determined by the partial transpose?
Srinivasan Arunachalam, Nathaniel Johnston, Vincent Russo
The absolute separability problem asks for a characterization of the quantum states with the property that is separable for all unitary matrices…
Quantum hedging in two-round prover-verifier interactions
Srinivasan Arunachalam, Abel Molina, Vincent Russo
We consider the problem of a particular kind of quantum correlation that arises in some two-party games. In these games, one player is presented with a question they must answer, y…
An algorithm for the T-count
David Gosset, Vadym Kliuchnikov, Michele Mosca +1
We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically…
Small sets of locally indistinguishable orthogonal maximally entangled states
Alessandro Cosentino, Vincent Russo
We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $…