Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0802.4193

A remark on the paper ``Randomizing quantum states: Constructions and applications''

Guillaume Aubrun

Published Feb 28, 2008• 4 citations
arXivHTMLPDF

Abstract

The concept of $\e$-randomizing quantum channels has been introduced by Hayden, Leung, Shor and Winter in connection with approximately encrypting quantum states. They proved using a discretization argument that sets of roughly $d \log d$ random unitary operators provide examples of such channels on $\C^d$. We show that a simple trick improves the efficiency of the argument and reduces the number of unitary operators to roughly $d$.

DOI
10.48550/arxiv.0802.4193

Related papers

Randomizing Channels in Quantum Information Theory

정갑균

The randomization of quantum states in Quantum Information Theory is an important issue and has many applications on information processing. Such a method for randomizing quantum states is given by a completely positive and trace-preserving map known as an epsilon-randomizing map or a random unitary channel.\nIn this thesis, we represent a general formula for the\nepsilon-randomizing maps with respect to the p-norm of\nd dimensional quantum states and introduce some applications. Recently, the epsilon-randomizing channel together with its complementary channel gives a key technique for the proof of the additivity conjecture, that is, the additivity violation for the classical\ncapacity of quantum channel, which is the motivation of our work.\n\nThere are plenty of applications of the epsilon-randomizing channels in the view of reducing communication resources as well as the approximate encryption and decryption of quantum states. We explicitly investigate several applications such as\napproximate quantum state sharing, approximate state merging, and quantum sequential transmission protocol.

•Jan 1, 2012•2 citations

On Random Purifications of Isometries and Channels

Eli Goldin

Acorn tricks turn weak quantum resources into stronger "randomized" ones. A recent example is the random purification channel, which turns $t$ copies of a mixed state into $t$ copies of a random purification. We ask whether analogous techniques can turn queries to an isometry into queries to a random unitary completion, or queries to a quantum channel into queries to a random isometry dilation. For an isometry from dimension $N$ to dimension $M$, we give an efficient, stateful simulator for $T$ sequential, forward queries to a fixed Haar random unitary completion. It uses at most one forward isometry query per simulated call, with total trace-distance error $O(T\sqrt{N/(M-T)})$. This lifts isometry query lower bounds to arbitrary unitary completions, and copy complexity lower bounds to forward access to state preparation unitaries, with dimension-dependent loss that can be made arbitrarily small for most applications. Conversely, we construct two distributions on quantum channels distinguishable exactly with two queries to an arbitrary dilation, but requiring exponentially many channel queries for nonnegligible advantage. This rules out efficient simulation of random channel dilations. Our technique also shows that approximating the quantum switch to any constant error below $1/2$ requires exponentially many channel queries, even for identical channels, giving an exponential query advantage for indefinite causal order and improving on Bavaresco et al. (2025). Finally, we show how to "decontrol" controlled forward access to an isometry: any algorithm making controlled queries to $φV$ for a random phase $φ$ can be transformed into one using the same number of uncontrolled forward queries to $V$, generalizing the analogous result for unitaries.

quant-pharXiv:2611.04573•Nov 4, 2026•2 citations

Approximate Private Quantum Channels

Dickinson, Paul

This thesis includes a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for $ε$-randomizing maps, $n+2\log(1/ε)+c$ bits required to $ε$-randomize an arbitrary $n$-qubit state by improving a scheme of Ambainis and Smith \cite{AS04} based on small bias spaces \cite{NN90, AGHP92}. We show by a probabilistic argument that in fact the great majority of random schemes using slightly more than this many bits of key are also $ε$-randomizing. We provide the first known non-trivial lower bound for $ε$-randomizing maps, and develop several conditions on them which we hope may be useful in proving stronger lower bounds in the future.

arXiv:quant-ph/0611037•Nov 2, 2006•0 citations

Randomizing quantum states in Shatten ppp-norms

Kabgyun Jeong

In this paper, we formularize a method for randomizing quantum states with respect to the Schatten $p$-norm ($p\ge1$). Our theorem includes the Lemma 2.2 of Hayden and Winter [Commun. Math. Phys. {\bf 284}, 263--280 (2008)] for the norm case of $p>1$. We exploit the methods of a net construction on the unit sphere and McDiard's inequality in probability theory, and then we prove certain general cases (all $p$) of randomization tool for quantum states, which includes the operator norm and trace norm simultaneously in a single statement.

arXiv:1204.1813•Apr 9, 2012•0 citations

Approximate Randomization of Quantum States With Fewer Bits of Key

Paul A. Dickinson, Ashwin Nayak

Randomization of quantum states is the quantum analogue of the classical one‐time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/ε2) Pauli operators to map any d‐dimensional state to a state that is within trace distance ε of the completely mixed state. Our bound is a log d factor smaller than that of Hayden, Leung, Shor, and Winter, and Ambainis and Smith.Then, we show that a random sequence of essentially the same number of unitary operators, chosen from an appropriate set, with high probability form an approximately randomizing map for d‐dimensional states. Finally, we discuss the optimality of these schemes via connections to different notions of pseudorandomness, and give a new lower bound for small ε.

arXiv:quant-ph/0611033•AIP conference proceedings•Jan 1, 2006•33 citations

Generating random quantum channels

Ryszard Kukulski, Ion Nechita, Łukasz Pawela +2 more

Several techniques of generating random quantum channels, which act on the set of d-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show that they are mathematically equivalent. We discuss under which conditions they give the uniform Lebesgue measure on the convex set of quantum operations and compare their advantages and computational complexity and demonstrate which of them is particularly suitable for numerical investigations. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states. We compute the mean values of several quantities characterizing a given quantum channel, including its unitarity, the average output purity, and the 2-norm coherence of a channel, averaged over the entire set of the quantum channels with respect to the uniform measure. An ensemble of classical stochastic matrices obtained due to super-decoherence of random quantum stochastic maps is analyzed, and their spectral properties are studied using the Bloch representation of a classical probability vector.

arXiv:2011.02994•Journal of Mathematical Physics•Jun 1, 2021•64 citations
The concept of \e\e\e-randomizing quantum channels has been introduced by Hayden, Leung, Shor and Winter in connection with approximately encrypting quantum states. They proved using a discretization argument that sets of roughly dlog⁡dd \log ddlogd random unitary operators provide examples of such channels on \Cd\C^d\Cd. We show that a simple trick improves the efficiency of the argument and reduces the number of unitary operators to roughly ddd.
The randomization of quantum states in Quantum Information Theory is an important issue and has many applications on information processing. Such a method for randomizing quantum states is given by a completely positive and trace-preserving map known as an epsilon-randomizing map or a random unitary channel.\nIn this thesis, we represent a general formula for the\nepsilon-randomizing maps with respect to the p-norm of\nd dimensional quantum states and introduce some applications. Recently, the epsilon-randomizing channel together with its complementary channel gives a key technique for the proof of the additivity conjecture, that is, the additivity violation for the classical\ncapacity of quantum channel, which is the motivation of our work.\n\nThere are plenty of applications of the epsilon-randomizing channels in the view of reducing communication resources as well as the approximate encryption and decryption of quantum states. We explicitly investigate several applications such as\napproximate quantum state sharing, approximate state merging, and quantum sequential transmission protocol.
Acorn tricks turn weak quantum resources into stronger "randomized" ones. A recent example is the random purification channel, which turns ttt copies of a mixed state into ttt copies of a random purification. We ask whether analogous techniques can turn queries to an isometry into queries to a random unitary completion, or queries to a quantum channel into queries to a random isometry dilation. For an isometry from dimension NNN to dimension MMM, we give an efficient, stateful simulator for TTT sequential, forward queries to a fixed Haar random unitary completion. It uses at most one forward isometry query per simulated call, with total trace-distance error O(TN/(M−T))O(T\sqrt{N/(M-T)})O(TN/(M−T)​). This lifts isometry query lower bounds to arbitrary unitary completions, and copy complexity lower bounds to forward access to state preparation unitaries, with dimension-dependent loss that can be made arbitrarily small for most applications. Conversely, we construct two distributions on quantum channels distinguishable exactly with two queries to an arbitrary dilation, but requiring exponentially many channel queries for nonnegligible advantage. This rules out efficient simulation of random channel dilations. Our technique also shows that approximating the quantum switch to any constant error below 1/21/21/2 requires exponentially many channel queries, even for identical channels, giving an exponential query advantage for indefinite causal order and improving on Bavaresco et al. (2025). Finally, we show how to "decontrol" controlled forward access to an isometry: any algorithm making controlled queries to φVφVφV for a random phase φφφ can be transformed into one using the same number of uncontrolled forward queries to VVV, generalizing the analogous result for unitaries.
This thesis includes a survey of the results known for private and approximate private quantum channels. We develop the best known upper bound for εεε-randomizing maps, n+2log⁡(1/ε)+cn+2\log(1/ε)+cn+2log(1/ε)+c bits required to εεε-randomize an arbitrary nnn-qubit state by improving a scheme of Ambainis and Smith \cite{AS04} based on small bias spaces \cite{NN90, AGHP92}. We show by a probabilistic argument that in fact the great majority of random schemes using slightly more than this many bits of key are also εεε-randomizing. We provide the first known non-trivial lower bound for εεε-randomizing maps, and develop several conditions on them which we hope may be useful in proving stronger lower bounds in the future.
In this paper, we formularize a method for randomizing quantum states with respect to the Schatten ppp-norm (p≥1p\ge1p≥1). Our theorem includes the Lemma 2.2 of Hayden and Winter [Commun. Math. Phys. {\bf 284}, 263--280 (2008)] for the norm case of p>1p>1p>1. We exploit the methods of a net construction on the unit sphere and McDiard's inequality in probability theory, and then we prove certain general cases (all ppp) of randomization tool for quantum states, which includes the operator norm and trace norm simultaneously in a single statement.
Randomization of quantum states is the quantum analogue of the classical one‐time pad. We present an improved, efficient construction of an approximately randomizing map that uses O(d/ε2) Pauli operators to map any d‐dimensional state to a state that is within trace distance ε of the completely mixed state. Our bound is a log d factor smaller than that of Hayden, Leung, Shor, and Winter, and Ambainis and Smith.Then, we show that a random sequence of essentially the same number of unitary operators, chosen from an appropriate set, with high probability form an approximately randomizing map for d‐dimensional states. Finally, we discuss the optimality of these schemes via connections to different notions of pseudorandomness, and give a new lower bound for small ε.
Several techniques of generating random quantum channels, which act on the set of d-dimensional quantum states, are investigated. We present three approaches to the problem of sampling of quantum channels and show that they are mathematically equivalent. We discuss under which conditions they give the uniform Lebesgue measure on the convex set of quantum operations and compare their advantages and computational complexity and demonstrate which of them is particularly suitable for numerical investigations. Additional results focus on the spectral gap and other spectral properties of random quantum channels and their invariant states. We compute the mean values of several quantities characterizing a given quantum channel, including its unitarity, the average output purity, and the 2-norm coherence of a channel, averaged over the entire set of the quantum channels with respect to the uniform measure. An ensemble of classical stochastic matrices obtained due to super-decoherence of random quantum stochastic maps is analyzed, and their spectral properties are studied using the Bloch representation of a classical probability vector.