Jose Carrasco

Experimental measurement and a physical interpretation of quantum shadow enumerators

Daniel Miller [1,2], Kyano Levi [1], Lukas Postler [3], Alex Steiner [3], Lennart Bittel [1], Gregory A. L. White [1], Yifan Tang [1], Eric J. Kuehnke [1], Antonio A. Mele [1], Sumeet Khatri [1,4,5], Lorenzo Leone [1], Jose Carrasco [1], Christian D. Marciniak [3], Ivan Pogorelov [3], Milena Guevara-Bertsch [3], Robert Freund [3], Rainer Blatt [3,6], Philipp Schindler [3], Thomas Monz [3,7], Martin Ringbauer [3], Jens Eisert [1]

Abstract

Throughout its history, the theory of quantum error correction has heavily benefited from translating classical concepts into the quantum setting. In particular, classical notions of weight enumerators, which relate to the performance of an error-correcting code, and MacWilliams' identity, which helps to compute enumerators, have been generalized to the quantum case. In this work, we establish a distinct relationship between the theoretical machinery of quantum weight enumerators and a seemingly unrelated physics experiment: we prove that Rains' quantum shadow enumerators - a powerful mathematical tool - arise as probabilities of observing fixed numbers of triplets in a Bell sampling experiment. This insight allows us to develop here a rigorous framework for the direct measurement of quantum weight enumerators, thus enabling experimental and theoretical studies of the entanglement structure of any quantum error-correcting code or state under investigation. On top of that, we derive concrete sample complexity bounds and physically-motivated robustness guarantees against unavoidable experimental imperfections. Finally, we experimentally demonstrate the possibility of directly measuring weight enumerators on a trapped-ion quantum computer. Our experimental findings are in good agreement with theoretical predictions and illuminate how entanglement theory and quantum error correction can cross-fertilize each other once Bell sampling experiments are combined with the theoretical machinery of quantum weight enumerators.

Towards experimental classical verification of quantum computation

Roman Stricker [1], Jose Carrasco [2], Martin Ringbauer [1], Lukas Postler [1], Michael Meth [1], Claire Edmunds [1], Philipp Schindler [1], Rainer Blatt [1,3], Peter Zoller [2,3], Barbara Kraus [2], Thomas Monz [1,4]

Abstract

With today's quantum processors venturing into regimes beyond the capabilities of classical devices [1-3], we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers [4,5]. In a recent breakthrough in computer science [6-8], a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment a verification protocol using only classical means on a small trapped-ion quantum processor. We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking [9], or additional quantum resources in case we do not have access to or trust in the device to be tested [5]. While our experimental demonstration uses a simplified version [10] of Mahadev's protocol [6] we demonstrate the necessary steps for verifying fully untrusted devices. A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post-quantum secure trapdoor functions within an interactive proof [11]. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage [8], generating [12] and certifying quantum randomness [7], or composable remote state preparation [13].

Symmetry-resolved dynamical purification in synthetic quantum matter

Vittorio Vitale [1,2], Andreas Elben [3,4], Richard Kueng [5], Antoine Neven [6], Jose Carrasco [6], Barbara Kraus [6], Peter Zoller [3,4], Pasquale Calabrese [1,2,3,4,8], Benoit Vermersch, Marcello Dalmonte [1,2]

Abstract

When a quantum system initialized in a product state is subjected to either coherent or incoherent dynamics, the entropy of any of its connected partitions generically increases as a function of time, signalling the inevitable spreading of (quantum) information throughout the system. Here, we show that, in the presence of continuous symmetries and under ubiquitous experimental conditions, symmetry-resolved information spreading is inhibited due to the competition of coherent and incoherent dynamics: in given quantum number sectors, entropy decreases as a function of time, signalling dynamical purification. Such dynamical purification bridges between two distinct short and intermediate time regimes, characterized by a log-volume and log-area entropy law, respectively. It is generic to symmetric quantum evolution, and as such occurs for different partition geometry and topology, and classes of (local) Liouville dynamics. We then develop a protocol to measure symmetry-resolved entropies and negativities in synthetic quantum systems based on the random unitary toolbox, and demonstrate the generality of dynamical purification using experimental data from trapped ion experiments [Brydges et al., Science 364, 260 (2019)]. Our work shows that symmetry plays a key role as a magnifying glass to characterize many-body dynamics in open quantum systems, and, in particular, in noisy-intermediate scale quantum devices.