We investigate the asymptotic dynamics of quantum networks under repeated applications of random unitary operations. It is shown that in the asymptotic limit of large numbers of iterations this dynamics is generally governed by a typically low dimensional attractor space. This space is determined completely by the unitary operations involved and it is independent of the probabilities with which these unitary operations are applied. Based on this general feature analytical results are presented for the asymptotic dynamics of arbitrarily large cyclic qubit networks whose nodes are coupled by randomly applied controlled-NOT operations.
Randomized benchmarking is a useful scheme for evaluation the average fidelity of a noisy quantum circuit. However, it is insensitive to the unitary error. Here, we propose a method of randomized benchmarking in which a unitary t-design is applied and by which the unitary error estimation can be converted to analysis of pseudo-randomness on a set of unitary operators. We give a bound on the number of randomized benchmarking sequences, when performing a unitary t-design on n-qubit d-dimensional system. By applying local random unitary operators, a decomposition of a unitary t-design, the bound …
Werner states are defined as bipartite qudit states that remain unchanged under application of arbitrary unitary operators acting on both subsystems simultaneously. Their preparation is a crucial ingredient in entanglement distillation protocols. This thesis deals with an iterative approach to prepare Werner states asymptotically, using random unitary operations. The asymptotic dynamics of random unitary operations are linked to algebraic properties of the involved unitary operators applying results about general quantum operations. Then a family of random unitary operations is constructed, wh…
A random unitary channel is one that is given by a convex combination of unitary channels. It is shown that the conjectures on the additivity of the minimum output entropy and the multiplicativity of the maximum output $p$-norm can be equivalently restated in terms of random unitary channels. This is done by constructing a random unitary approximation to a general quantum channel. This approximation can be constructed efficiently, and so it is also applied to the computational problem of distinguishing quantum circuits. It is shown that the problem of distinguishing random unitary circuits is …
We analyze the asymptotic dynamics of quantum systems resulting from large numbers of iterations of random unitary operations. Although, in general, these quantum operations cannot be diagonalized it is shown that their resulting asymptotic dynamics is described by a diagonalizable superoperator. We prove that this asymptotic dynamics takes place in a typically low dimensional attractor space which is independent of the probability distribution of the unitary operations applied. This vector space is spanned by all eigenvectors of the unitary operations involved which are associated with eigenv…
Employing the currently discussed notion of pseudo-Hermiticity, we define a pseudo-unitary group. Further, we develop a random matrix theory which is invariant under such a group and call this ensemble of pseudo-Hermitian random matrices as the pseudo-unitary ensemble. We obtain exact results for the nearest-neighbour level spacing distribution for (2 X 2) PT-symmetric Hamiltonian matrices which has a novel form, s log (1/s) near zero spacing. This shows a level repulsion in marked distinction with an algebraic form in the Wigner surmise. We believe that this paves way for a description of var…
We analyze the non-Markovianity degree for random unitary evolution of d-level quantum systems. It is shown how non-Markovianity degree is characterized in terms of local decoherence rates. In particular we derive a sufficient condition for vanishing of the back ow of information.
We consider unitary conjugation channels with continuous random phases. The spectral properties of the channel average are examined, thereby the asymptotic behaviors of the repeated quantum interactions of the motion are derived. We then study the channels with uniformly distributed continuous phases on an interval. In this context, it is shown that discrete phases are sufficient to achieve the channel average.
We propose an easy implementable prepare-and-measure protocol for robust quantum key distribution with photon polarization. The protocol is fault tolerant against collective random unitary channel noise. The protocol does not need any collective quantum measurement or quantum memory. A security proof and a specific linear optical realization using spontaneous parametric down conversion are given.
By preparing an input state and measuring an observable for the output state, we can measure a quantum channel. Following the formulation given by Xiao et al., we study an uncertainty relation for ancilla-free measurements of random unitary channels acting on a qubit. We obtain an explicit formula and give a necessary and sufficient condition for this formula to be nontrivial.
We briefly review a recently proposed method to detect properties of quantum noise processes and quantum channels. We illustrate in detail the method for detecting non separable random unitary channels and consider in particular the explicit examples of the CNOT and CZ gates. We analyse their robustness in the presence of noise for several quantum noise models.
We show that a quantum channel $\mathcal{N}$ constructed by averaging over $\mathcal{O}(\log d/ε^2)$ randomly chosen unitaries gives a local $ε$-randomizing map with non-negative probability. The idea comes from a small $ε$-net construction on the higher dimensional unit sphere or quantum pure states. By exploiting the net, we analyze the concentrative phenomenon of an output reduced density matrix of the channel, and this analysis imply that there exists a local random unitary channel, with relatively small unitaries, generically.
In this article we provide necessary and sufficient conditions for a completely positive trace-preserving (CPT) map to be decomposable into a convex combination of unitary maps. Additionally, we set out to define a proper distance measure between a given CPT map and the set of random unitary maps, and methods for calculating it. In this way one could determine whether non-classical error mechanisms such as spontaneous decay or photon loss dominate over classical uncertainties, for example in a phase parameter. The present paper is a step towards achieving this goal.
We study the behavior of Quantum Darwinism (Zurek, [8]) within the iterative, random unitary operations qubit-model of pure decoherence (Novotny et al, [6]). We conclude that Quantum Darwinism, which describes the quantum mechanical evolution of an open system S from the point of view of its environment E, is not a generic phenomenon, but depends on the specific form of input states and on the type of S-E-interactions. Furthermore, we show that within the random unitary model the concept of Quantum Darwinism enables one to explicitly construct and specify artificial input states of environment…
The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation followed by projection onto the first O(log n) coordinates followed by a scaling works as a valid transformation with high probability. In this work, we show that the Haar random unitary can be replaced by a uniformly random unitary chosen from a finite set called an approximate unitary t-design for t = O(log n). Choosing a unitary from such a design requires…
We analyze random unitary evolution of the qubit within memory kernel approach. We provide sufficient conditions which guarantee that the corresponding memory kernel generates physically legitimate quantum evolution. Interestingly, we are able to recover several well known examples and generate new classes of nontrivial qubit evolution. Surprisingly, it turns out that quantum evolution with memory kernel generated by our approach gives rise to vanishing non-Markovianity measure based on the distinguishability of quantum states.
An ensemble of 2 x 2 pseudo-Hermitian random matrices is constructed that possesses real eigenvalues with level-spacing distribution exactly as for the Gaussian Unitary Ensemble found by Wigner. By a re-interpretation of Connes' spectral interpretation of the zeros of the Riemann zeta function, we propose to enlarge the scope of search of the Hamiltonian connected with the celebrated Riemann Hypothesis by suggesting that the Hamiltonian could also be PT-symmetric (or pseudo-Hermitian).
We study the scaling of the convergence of several statistical properties of a recently introduced random unitary circuit ensemble towards their limits given by the circular unitary ensemble (CUE). Our study includes the full distribution of the absolute square of a matrix element, moments of that distribution up to order eight, as well as correlators containing up to 16 matrix elements in a given column of the unitary matrices. Our numerical scaling analysis shows that all of these quantities can be reproduced efficiently, with a number of random gates which scales at most as $n_q\log (n_q/ε)…
We study quantum tomography from a continuous measurement record obtained by measuring expectation values of a set of Hermitian operators obtained from unitary evolution of an initial observable. For this purpose, we consider the application of a random unitary, diagonal in a fixed basis at each time step and quantify the information gain in tomography using Fisher information of the measurement record and the Shannon entropy associated with the eigenvalues of covariance matrix of the estimation. Surprisingly, very high fidelity of reconstruction is obtained using random unitaries diagonal in …
Unitary $2$-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and practical quantum information protocols, and also have been used to model the dynamics in complex quantum many-body systems. Here, we show that unitary $2$-designs can be approximately implemented by alternately repeating random unitaries diagonal in the Pauli-$Z$ basis and that in the Pauli-$X$ basis. We also provide a converse about the number of repetitions …
Computational and physical complexity of synthesizing random multi-qudit quantum states and unitary operators
Advanced ICT Research Institute, National Institute of Information and Communications Technology（先进ICT研究所，信息通信技术研究所）；Research Institute for Science and Technology, Tokyo University of Science（科学技术研究所，东京理科大学）；Institute for Quantum Information and Matter and Department of Physics, California Institute of Technology（量子信息与物质研究所和物理系，加州理工学院）
We compare two approaches to non-Markovian quantum evolution: one based on the concept of divisible maps and the other one based on distinguishability of quantum states. The former concept is fully characterized in terms of local generator whereas it is in general not true for the latter one. A simple example of random unitary dynamics of a qubit shows the intricate difference between those approaches. Moreover, in this case both approaches are fully characterized in terms of local decoherence rates. As a byproduct it is shown that entropy might monotonically increase even for non-Markovian qu…
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be achieved by quantum circuits composed of a few-qubit diagonal gates. We introduce diagonal-unitary $t$-designs and present two quantum circuits that implement diagonal-unitary $2$-designs with the computational basis in $N$-qubit systems. One is composed of single-qubit diagonal gates and controlled-phase gates with randomized phases, which achieves an exact di…
We prove that if any error channel has a Kraus decomposition that is simultaneously correctable and Hilbert-Schmidt (HS) complete, then the existence of Kraus sets with these properties guarantees the correctability of all quantum channels. As a proof of the existence of such Kraus sets, the $n$-level depolarization channel is shown to have a random-unitary (RU) decomposition that is both HS complete and correctable due its RU nature, thereby proving that all quantum channels are correctable. As an application, conditions for universal error-correction operations are presented.
With improved gate calibrations reducing unitary errors, we achieve a benchmarked single-qubit gate fidelity of 99.95% with superconducting qubits in a circuit quantum electrodynamics system. We present a method for distinguishing between unitary and non-unitary errors in quantum gates by interleaving repetitions of a target gate within a randomized benchmarking sequence. The benchmarking fidelity decays quadratically with the number of interleaved gates for unitary errors but linearly for non-unitary, allowing us to separate systematic coherent errors from decoherent effects. With this protoc…
Here, a new two-dimensional process, discrete in time and space, that yields the results of both a random walk and a quantum random walk, is introduced. This model describes the population distribution of four coin states |1>,-|1>, |0> -|0> in space without interference, instead of two coin states |1>, |0> .For the case of no boundary conditions, the model is similar to a Markov chain with a stochastic matrix, i.e., it conserves the population distribution of the four coin states, and by using a proper transformation, yield probability distributions of the two quantum states |1>, |0> in space,…
We address the problem of continuous-variable quantum phase estimation in the presence of linear disturbance at the Hamiltonian level, by means of Gaussian probe states. In particular we discuss both unitary and random disturbance, by considering the parameter which characterizes the unwanted linear term present in the Hamiltonian as fixed (unitary disturbance) or random with a given probability distribution (random disturbance). We derive the optimal input Gaussian states at fixed energy, maximizing the quantum Fisher information over the squeezing angle and the squeezing energy fraction, and…
We investigate the influence of dissipation and decoherence on quantum Darwinism by generalizing Zurek's original qubit model of decoherence and the establishment of pointer states (Zurek, Nature Physics 5, 181 - 188 (2009)). Our model allows for repeated multiple qubit-qubit couplings between system and environment which are described by randomly applied two-qubit quantum operations inducing entanglement, dissipation and dephasing. The resulting stationary qubit states of system and environment are investigated. They exhibit the intricate influence of entanglement generation, dissipation and …
We use the canonical coset parameterization and provide a formula with the unitary part of the Bures measure for non-degenerate systems in terms of the product of even Euclidean balls. This formula is shown to be consistent with the sampling of random states through the generation of random unitary matrices.
It is shown how any Lindbladian evolution with selfadjoint Lindblad operators, either Markovian or nonMarkovian, can be understood as an averaged random unitary evolution. Both mathematical and physical consequences are analyzed. First a simple and fast method to solve this kind of master equations is suggested and particularly illustrated with the phase-damped master equation for the multiphoton resonant Jaynes-Cummings model in the rotating-wave approximation. A generalization to some intrinsic decoherence models present in the literature is included. Under the same philosophy a proposal to …
Tensor products of M random unitary matrices of size N from the circular unitary ensemble are investigated. We show that the spectral statistics of the tensor product of random matrices becomes Poissonian if M=2, N become large or M become large and N=2.
We describe a scalable stochastic method for the experimental measurement of generalized fidelities characterizing the accuracy of the implementation of a coherent quantum transformation. The method is based on the motion reversal of random unitary operators. In the simplest case our method enables direct estimation of the average gate fidelity. The more general fidelities are characterized by a universal exponential rate of fidelity loss. In all cases the measurable fidelity decrease is directly related to the strength of the noise affecting the implementation -- quantified by the trace of th…
Entangled multipartite states are resources for universal quantum computation, but they can also give rise to ensembles of unitary transformations, a topic usually studied in the context of random quantum circuits. Using several graph state techniques, we show that these resources can `derandomize' circuit results by sampling the same kinds of ensembles quantum mechanically, (analogously to a quantum random number generator). Furthermore, we find simple examples that give rise to new ensembles whose statistical moments exactly match those of the uniformly random distribution over all unitaries…
Unitary $k$-designs are finite ensembles of unitary matrices that approximate the Haar distribution over unitary matrices. Several ensembles are known to be 2-designs, including the uniform distribution over the Clifford group, but no family of ensembles was previously known to form a 3-design. We prove that the Clifford group is a 3-design, showing that it is a better approximation to Haar-random unitaries than previously expected. Our proof strategy works for any distribution of unitaries satisfying a property we call Pauli 2-mixing and proceeds without the use of heavy mathematical machiner…
We analyze composed quantum systems consisting of $k$ subsystems, each described by states in the $n$-dimensional Hilbert space. Interaction between subsystems can be represented by a graph, with vertices corresponding to individual subsystems and edges denoting a generic interaction, modeled by random unitary matrices of order $n^2$. The global evolution operator is represented by a unitary matrix of size $N=n^k$. We investigate statistical properties of such matrices and show that they display spectral properties characteristic to Haar random unitary matrices provided the corresponding graph…
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classical random walks in their spreading rates and mixing times respectively. Non-unitary quantum walks can provide a useful optimisation of these properties, producing a more uniform distribution on the line, and faster mixing times on the cycle. We investigate the interplay between quantum and random dynamics by comparing the resources required, and examining numerically how the level of quantum correlations varies during the walk. We show numerically that the optimal non-unitary quantum walk procee…
We review the generation of random pure states using a protocol of repeated two qubit gates. We study the dependence of the convergence to states with Haar multipartite entanglement distribution. We investigate the optimal generation of such states in terms of the physical (real) time needed to apply the protocol, instead of the gate complexity point of view used in other works. This physical time can be obtained, for a given Hamiltonian, within the theoretical framework offered by the quantum brachistochrone formalism. Using an anisotropic Heisenberg Hamiltonian as an example, we find that di…
The theoretical description of quantum dynamics in an intriguing way does not necessarily imply the underlying dynamics is indeed intriguing. Here we show how a known very interesting master equation with an always negative decay rate [eternal non-Markovianity (ENM)] arises from simple stochastic Schrödinger dynamics (random unitary dynamics). Equivalently, it may be seen as arising from a mixture of Markov (semi-group) open system dynamics. Both these approaches lead to a more general family of CPT maps, characterized by a point within a parameter triangle. Our results show how ENM quantum dy…
Random unitary matrices find a number of applications in quantum information science, and are central to the recently defined boson sampling algorithm for photons in linear optics. We describe an operationally simple method to directly implement Haar random unitary matrices in optical circuits, with no requirement for prior or explicit matrix calculations. Our physically-motivated and compact representation directly maps independent probability density functions for parameters in Haar random unitary matrices, to optical circuit components. We go on to extend the results to the case of random u…
We explore the multifractality of the steady state wave function in non-unitary random quantum dynamics in one dimension. We focus on two classes of random systems: the hybrid Clifford circuit model and the non-unitary free fermion dynamics. In the hybrid Clifford model, we map the measurement driven transition to an Anderson localization transition in an effective graph space by using properties of the stabilizer state. We show that the volume law phase with nonzero measurement rate is non-ergodic in the graph space and exhibits weak multifractal behavior. We apply the same method to the hybr…
We study the growth of genuine multipartite entanglement in random quantum circuit models, which include random unitary circuit models and the random Clifford circuit. We find that for the random Clifford circuit, the growth of multipartite entanglement remains slower in comparison to the random unitary case. However, the final saturation value of multipartite entanglement is almost the same in both cases. The behavior is then compared to the genuine multipartite entanglement obtained in random matrix product states with a moderately high bond dimension. We then relate the behavior of multipar…
Quantum many-body scars in random unitary circuits
Université Paris-Saclay（巴黎萨克雷大学）；CNRS（法国国家科学研究中心）；Laboratoire de Physique de l’École normale supérieure（巴黎高等师范学院物理实验室）；ENS（巴黎高等师范学院）；Université PSL（巴黎文理研究大学）；Sorbonne Université（索邦大学）；Université Paris Cité（巴黎西岱大学）
In this paper, we study the behaviour of the output of pure entangled states after being transformed by a product of conjugate random unitary channels. This study is motivated by the counterexamples by Hastings and Hayden-Winter to the additivity problems. In particular, we study in depth the difference of behaviour between random unitary channels and generic random channels. In the case where the number of unitary operators is fixed, we compute the limiting eigenvalues of the output states. In the case where the number of unitary operators grows linearly with the dimension of the input space,…
Random quantum circuits are proficient information scramblers and efficient generators of randomness, rapidly approximating moments of the unitary group. We study the convergence of local random quantum circuits to unitary $k$-designs. Employing a statistical mechanical mapping, we give an exact expression of the distance to forming an approximate design as a lattice partition function. In the statistical mechanics model, the approach to randomness has a simple interpretation in terms of domain walls extending through the circuit. We analytically compute the second moment, showing that random …
We study the scrambling of quantum information in local random unitary circuits by focusing on the tripartite information proposed by Hosur et al. We provide exact results for the averaged Rényi-$2$ tripartite information in two cases: (i) the local gates are Haar random and (ii) the local gates are dual-unitary and randomly sampled from a single-site Haar-invariant measure. We show that the latter case defines a one-parameter family of circuits, and prove that for a "maximally chaotic" subset of this family quantum information is scrambled faster than in the Haar-random case. Our approach is …
The applications of random quantum circuits range from quantum computing and quantum many-body systems to the physics of black holes. Many of these applications are related to the generation of quantum pseudorandomness: Random quantum circuits are known to approximate unitary $t$-designs. Unitary $t$-designs are probability distributions that mimic Haar randomness up to $t$th moments. In a seminal paper, Brandão, Harrow and Horodecki prove that random quantum circuits on qubits in a brickwork architecture of depth $O(n t^{10.5})$ are approximate unitary $t$-designs. In this work, we revisit th…
The value of spectral form factor at the origin, called level compressibility, is an important characteristic of random spectra. The paper is devoted to analytical calculations of this quantity for different random unitary matrices describing models with intermediate spectral statistics. The computations are based on the approach developed by G. Tanner in [J. Phys. A: Math. Gen. 34, 8485 (2001)] for chaotic systems. The main ingredient of the method is the determination of eigenvalues of a transition matrix whose matrix elements equal squared moduli of matrix elements of the initial unitary ma…
In the context of unitary evolution of a generic quantum system interrupted at random times with non-unitary evolution due to interactions with either the external environment or a measuring apparatus, we adduce a general theoretical framework to obtain the average density operator of the system at any time during the dynamical evolution. The average is with respect to the classical randomness associated with the random time intervals between successive interactions, which we consider to be independent and identically-distributed random variables. We provide two explicit applications of the fo…
I use quaternion free probability calculus - an extension of free probability to non-Hermitian matrices (which is introduced in a succinct but self-contained way) - to derive in the large-size limit the mean densities of the eigenvalues and singular values of sums of independent unitary random matrices, weighted by complex numbers. In the case of CUE summands, I write them in terms of two "master equations," which I then solve and numerically test in four specific cases. I conjecture a finite-size extension of these results, exploiting the complementary error function. I prove a central limit …
