English
Related papers

Related papers: On almost randomizing channels with a short Kraus …

200 papers

We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…

Dynamical Systems · Mathematics 2025-05-06 Pablo G. Barrientos , Dominique Malicet

The group symmetries inherent in quantum channels often make them tractable and applicable to various problems in quantum information theory. In this paper, we introduce natural probability distributions for covariant quantum channels.…

Quantum Physics · Physics 2025-07-17 Ion Nechita , Sang-Jun Park

We establish methods for quantum state tomography based on compressed sensing. These methods are specialized for quantum states that are fairly pure, and they offer a significant performance improvement on large quantum systems. In…

Quantum Physics · Physics 2015-05-14 David Gross , Yi-Kai Liu , Steven T. Flammia , Stephen Becker , Jens Eisert

The random purification channel maps n copies of any mixed quantum state to n copies of a random purification of the state. We generalize this construction to arbitrary symmetries: for any group G of unitaries, we construct a quantum…

Quantum Physics · Physics 2025-12-23 Michael Walter , Freek Witteveen

Quantum process tomography, the task of estimating an unknown quantum channel, is a central problem in quantum information theory. A long-standing open question is to determine the optimal number of uses of an unknown channel required to…

Quantum Physics · Physics 2026-01-19 Antonio Anna Mele , Lennart Bittel

Microscopic Hamiltonian models of the composite system "open system + environment" typically do not provide the operator-sum Kraus form of the open system's dynamical map. With the use of a recently de- veloped method [16], we derive the…

Quantum Physics · Physics 2017-05-08 Momir Arsenijevic , Jasmina Jeknic-Dugic , Miroljub Dugic

The asymptotic form of the average probability to count $N$ indistinguishable identical particles in a small number $r \ll N$ of binned-together output ports of a $M$-port Haar-random unitary network, proposed recently in \textit{Scientific…

Quantum Physics · Physics 2017-12-06 V. S. Shchesnovich

Quantum entanglement is usually revealed via a well aligned, carefully chosen set of measurements. Yet, under a number of experimental conditions, for example in communication within multiparty quantum networks, noise along the channels or…

We show that combining randomized measurement protocols with importance sampling allows for characterizing entanglement in significantly larger quantum systems and in a more efficient way than in previous work. A drastic reduction of…

Quantum Physics · Physics 2023-01-26 Aniket Rath , Rick van Bijnen , Andreas Elben , Peter Zoller , Benoît Vermersch

In Ref. [1], we proved a duality between two optimizations problems. The primary one is, given two quantum channels M and N, to find a quantum channel R such that RN is optimally close to M as measured by the worst-case entanglement…

Quantum Physics · Physics 2011-08-26 Cédric Bény , Ognyan Oreshkov

We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the average fidelity, to which experimental data may…

Quantum Physics · Physics 2019-01-23 Daniel Stilck França , Anna-Lena Hashagen

Since a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential…

Quantum Physics · Physics 2013-07-12 Mark M. Wilde

We develop an efficient algorithm for sampling the eigenvalues of random matrices distributed according to the Haar measure over the orthogonal or unitary group. Our technique samples directly a factorization of the Hessenberg form of such…

Numerical Analysis · Mathematics 2021-02-25 Massimiliano Fasi , Leonardo Robol

We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly…

Quantum Physics · Physics 2009-10-31 Lu-Ming Duan , Guang-Can Guo

We study how to estimate a nearly low-rank Toeplitz covariance matrix $T$ from compressed measurements. Recent work of Qiao and Pal addresses this problem by combining sparse rulers (sparse linear arrays) with frequency finding (sparse…

Data Structures and Algorithms · Computer Science 2019-11-20 Hannah Lawrence , Jerry Li , Cameron Musco , Christopher Musco

We study the optimization of any quantum process by minimizing the "randomness" in the measurement result at the output of that quantum process. We conceptualize and propose a measure of such randomness and inquire whether an optimization…

Quantum Physics · Physics 2021-03-30 Sreetama Das , Asutosh Kumar , Aditi Sen De , Ujjwal Sen

We study the relationship between quantum chaos and pseudorandomness by developing probes of unitary design. A natural probe of randomness is the "frame potential," which is minimized by unitary $k$-designs and measures the $2$-norm…

Quantum Physics · Physics 2017-05-24 Daniel A. Roberts , Beni Yoshida

Quantum state separation is a probabilistic map that transforms a given set of pure states into another set of more distinguishable ones. Here we investigate such a map acting onto uniparametric families of symmetric linearly dependent or…

Quantum Physics · Physics 2017-03-09 M. A. Solís-Prosser , A. Delgado , O. Jiménez , L. Neves

Neural quantum states (NQS) are a novel class of variational many-body wave functions that are very flexible in approximating diverse quantum states. Optimization of an NQS ansatz requires sampling from the corresponding probability…

Strongly Correlated Electrons · Physics 2021-09-15 Andrey A. Bagrov , Askar A. Iliasov , Tom Westerhout

We consider the problem of approximating an unknown function $u\in L^2(D,\rho)$ from its evaluations at given sampling points $x^1,\dots,x^n\in D$, where $D\subset \mathbb{R}^d$ is a general domain and $\rho$ is a probability measure. The…

Numerical Analysis · Mathematics 2018-05-29 Benjamin Arras , Markus Bachmayr , Albert Cohen