10 citations · 19 across the 12 of their papers we have counts for
13 papers · 1 filter
Sharp bounds for perfect quantum state classification beyond antidistinguishability
Nathaniel Johnston, Benjamin Lovitz, Vincent Russo +1
A multiset of pure quantum states is said to be k-learnable if there is a measurement strategy that always narrows an unknown sample drawn from the list down to one of at most k ca…
Satisfying Quantum Codes: Physics-Informed and Hardware-Aware Code Design with SAT Solvers
Ben DalFavero, William M. Watkins, Margarite L. LaBorde +4
Although quantum error correction is widely believed to be necessary for impactful applications of quantum computers, the design of quantum error correction codes is largely done b…
Stabilizer rank bounds for magic-state orbits
Farrokh Labib, Vincent Russo
Distinct Clifford orbits of magic states can exhibit different stabilizer ranks at small tensor powers. We establish this for qutrits, where the single-qutrit Clifford group has fo…
Opportunities and challenges in scaling quantum error detection on hardware
Yanis Le Fur, Ethan Egger, Hong-Ye Hu +3
Quantum error detection can produce unbiased expectation values that exponentially converge to noiseless results as the code distance is increased. Despite this, its performance as…
Compressed Sensing for Efficient Fidelity Estimation of GHZ States
Farrokh Labib, David Nicholaeff, Vincent Russo +1
Accurately characterizing multipartite entangled states is a critical challenge in quantum information processing. In this work, we focus on applying compressed sensing techniques…
Distinguishability of locally diagonal orthogonally invariant quantum states
Nathaniel Johnston, Vincent Russo
We study the distinguishability of quantum states under local operations with classical communication (LOCC), separable, and positive-partial-transpose (PPT) measurements, focusing…
Local strategies are pretty good at computing Boolean properties of quantum sequences
Tathagata Gupta, Ankith Mohan, Shayeef Murshid +3
Quantum memory is a scarce and costly resource, yet little is known about which learning tasks remain feasible under severe memory constraints. We study the problem of computing gl…
The complexity of perfect quantum state classification
Nathaniel Johnston, Benjamin Lovitz, Vincent Russo +1
The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work…
Quantum nonlocality without entanglement and state discrimination measures
Shayeef Murshid, Tathagata Gupta, Vincent Russo +1
An ensemble of product states is said to exhibit "quantum nonlocality without entanglement" if it cannot be optimally discriminated using local operations and classical communicati…
Optimal discrimination of quantum sequences
Tathagata Gupta, Shayeef Murshid, Vincent Russo +1
A key concept of quantum information theory is that accessing information encoded in a quantum system requires us to discriminate between several possible states the system could b…
Locally distinguishing a maximally entangled basis using shared entanglement
Somshubhro Bandyopadhyay, Vincent Russo
We consider the problem of distinguishing between the elements of a bipartite maximally entangled orthonormal basis using local operations and classical communication (LOCC) and a…
Quantum error mitigation by layerwise Richardson extrapolation
Vincent Russo, Andrea Mari
A widely used method for mitigating errors in noisy quantum computers is Richardson extrapolation, a technique in which the overall effect of noise on the estimation of quantum exp…
Tight bounds for antidistinguishability and circulant sets of pure quantum states
Nathaniel Johnston, Vincent Russo, Jamie Sikora
A set of pure quantum states is said to be antidistinguishable if upon sampling one at random, there exists a measurement to perfectly determine some state that was not sampled. We…