Quantum networks are composed of nodes which can send and receive quantum states by exchanging photons. Their goal is to facilitate quantum communication between any nodes, something which can be used to send secret messages in a secure way, and to communicate more efficiently than in classical networks. These goals can be achieved, for instance, via teleportation. Here we show that the design of efficient quantum communication protocols in quantum networks involves intriguing quantum phenomena, depending both on the way the nodes are displayed, and the entanglement between them. These phenomena can be employed to design protocols which overcome the exponential decrease of signals with the number of nodes. We relate the problem of establishing maximally entangled states between nodes to classical percolation in statistical mechanics, and demonstrate that quantum phase transitions can be used to optimize the operation of quantum networks.
We present percolation strategies based on multipartite measurements to propagate entanglement in quantum networks. We consider networks spanned on regular lattices whose bonds correspond to pure but non-maximally entangled pairs of qubits, with any quantum operation allowed at the nodes. Despite significant effort in the past, improvements over naive (classical) percolation strategies have been found for only few lattices, often with restrictions on the initial amount of entanglement in the bonds. In contrast, multipartite entanglement percolation outperform the classical percolation protocol…
Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes evolution of network connectivity with respect to some network parameters. In this framework, the probability to establish perfect entanglement between two remote partners decays exponentially with the distance between them before the percolation transition point, which unambiguously defines percolation properties of any classical network or lattice. Here we …
We study strategies for establishing long-distance entanglement in quantum networks. Specifically, we consider networks consisting of regular lattices of nodes, in which the nearest neighbors share a pure, but non-maximally entangled pair of qubits. We look for strategies that use local operations and classical communication. We compare the classical entanglement percolation protocol, in which every network connection is converted with a certain probability to a singlet, with protocols in which classical entanglement percolation is preceded by measurements designed to transform the lattice str…
We develop a concept of entanglement percolation for long-distance singlet generation in quantum networks with neighboring nodes connected by partially entangled bipartite mixed states. We give a necessary and sufficient condition on the class of mixed network states for the generation of singlets. States beyond this class are insufficient for entanglement percolation. We find that neighboring nodes are required to be connected by multiple partially entangled states and devise a rich variety of distillation protocols for the conversion of these states into singlets. These distillation protocol…
An Operator-Theoretic Model of Entanglement Percolation in Series-Parallel Quantum Networks
College of Mathematics, Taiyuan University of Technology（太原理工大学数学学院）；School of Mathematics and Statistics, Shaanxi Normal University（陕西师范大学数学与统计学院）；School of Mathematics, Xi’an University of Technology（西安理工大学数学学院）
We prove that enhanced entanglement percolation via lattice transformation is possible even if the new lattice is more poorly connected in that: i) the coordination number (a local property) decreases, or ii) the classical percolation threshold (a global property) increases. In searching for protocols to transport entanglement across a network, it seems reasonable to try transformations that increase connectivity. In fact, all examples that we are aware of violate both conditions i and ii. One might therefore conjecture that all good transformations must violate them. Here we provide a counter…
In this work, we explore the analogy between entanglement and secret classical correlations in the context of large networks, more precisely the question of percolation of secret correlations in a network. It is known that entanglement percolation in quantum networks can display a highly nontrivial behavior depending on the topology of the network and on the presence of entanglement between the nodes. Here we show that this behavior, thought to be of a genuine quantum nature, also occurs in a classical context.
Entanglement indcued non--additivity of classical communication capacity in networks consisting of quantum channels is considered. Communication lattices consisiting of butterfly-type entanglement breaking channels augmented, with some probability, by identity channels are analyzed. The capacity superadditivity in the network is manifested in directed correlated bond percolation which we consider in two flavours: simply directed and randomly oriented. The obtained percolation properties show that high capacity information transfer sets in much faster in the regime of superadditive communicatio…
Negativity Percolation in Continuous-Variable Quantum Networks
College of Mathematics, Taiyuan University of Technology（太原理工大学数学学院）；School of Mathematics and Statistics, Shaanxi Normal University（陕西师范大学数学与统计学院）；Network Science and Technology Center, Rensselaer Polytechnic Institute（伦斯勒理工学院网络科学与技术中心）；Department of Physics, Applied Physics, and Astronomy, Rensselaer Polytechnic Institute（伦斯勒理工学院物理、应用物理和天文学系）；Department of Computer Science, Rensselaer Polytechnic Institute（伦斯勒理工学院计算机科学系）；Department of Physics, Bar-Ilan University（巴伊兰大学物理系）
Dynamical entanglement percolation with spatially correlated disorder
Università La Sapienza（罗马大学）；Istituto dei sistemi Complessi, Consiglio Nazionale delle Ricerche（复杂系统研究所，意大利国家研究委员会）；Istituto dei Sistemi Complessi (ISC-CNR)（复杂系统研究所（ISC-CNR））
Quantum networks are essential to quantum information distributed applications, and communicating over them is a key challenge. Complex networks have rich and intriguing properties, which are as yet unexplored in the quantum setting. Here, we study the effect of entanglement percolation as a means to establish long-distance entanglement between arbitrary nodes of quantum complex networks. We develop a theory to analytically study random graphs with arbitrary degree distribution and give exact results for some models. Our findings are in good agreement with numerical simulations and show that t…
A central challenge for many quantum technologies concerns the generation of large entangled states of individually addressable quantum memories. Here, we show that percolation theory allows the rapid production of arbitrarily large graph states by heralded photonic entanglement in a lattice of atomic memories. This approach can greatly reduce the time required to produce large cluster resource states for quantum information processing, including states required for universal one-way quantum computing. This reduction puts our architecture in an operational regime where demonstrated collection,…
Establishing long-distance quantum entanglement, i.e., entanglement transmission, in quantum networks (QN) is a key and timely challenge for developing efficient quantum communication. Traditional comprehension based on classical percolation assumes a necessary condition for successful entanglement transmission between any two infinitely distant nodes: they must be connected by at least a path of perfectly entangled states (singlets). Here, we relax this condition by explicitly showing that one can focus not on optimally converting singlets but on establishing concurrence -- a key measure of b…
We consider 2D networks composed of nodes initially linked by two-qubit mixed states. In these networks we develop a global error correction scheme that can generate distance-independent entanglement from arbitrary network geometries using rank two states. By using this method and combining it with the concept of percolation we also show that the generation of long distance entanglement is possible with rank three states. Entanglement percolation and global error correction have different advantages depending on the given situation. To reveal the trade-off between them we consider their applic…
Entanglement transitions in quantum dynamics present a novel class of phase transitions in non-equilibrium systems. When a many-body quantum system undergoes unitary evolution interspersed with monitored random measurements, the steady-state can exhibit a phase transition between volume and area-law entanglement. There is a correspondence between measurement-induced transitions in non-unitary quantum circuits in $d$ spatial dimensions and classical statistical mechanical models in $d+1$ dimensions. In certain limits these models map to percolation, but there is analytical and numerical evidenc…
The concentration and distribution of quantum entanglement is an essential ingredient in emerging quantum information technologies. Much theoretical and experimental effort has been expended in understanding how to distribute entanglement in one-dimensional networks. However, as experimental techniques in quantum communication develop, protocols for multi-dimensional systems become essential. Here, we focus on recent theoretical developments in protocols for distributing entanglement in regular and complex networks, with particular attention to percolation theory and network-based error correc…
We study entanglement distribution in quantum complex networks where nodes are connected by bipartite entangled states. These networks are characterized by a complex structure, which dramatically affects how information is transmitted through them. For pure quantum state links, quantum networks exhibit a remarkable feature absent in classical networks: it is possible to effectively rewire the network by performing local operations on the nodes. We propose a family of such quantum operations that decrease the entanglement percolation threshold of the network and increase the size of the giant c…
Percolation theory allows simple description of the phase transition based on the scaling properties of the network clusters with respect to a single parameter - site or bond occupation probability. How to design a network exhibiting the percolation transition for a chosen occupation probability has been an open problem. At the same time, the task to find a structurally simple network having the desired property seemed to be impossible. I suggest a model, where the combination of the classical and the quantum resources creates a percolation transition, continuous or discontinuous on demand, fo…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the long-time behaviour appears untreatable with direct numerical methods. We develop novel analytic methods based on the theory of random unitary operations which help us to determine explicitly the asymptotic dynamics of quantum walks on 2D finite integer lattices with percolation. Based on this theory we find new unexpected features of percolated walks like …
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well-studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We us…
Coherent evolution governs the behaviour of all quantum systems, but in nature it is often subjected to influence of a classical environment. For analysing quantum transport phenomena quantum walks emerge as suitable model systems. In particular, quantum walks on percolation structures constitute an attractive platform for studying open system dynamics of random media. Here, we present an implementation of quantum walks differing from the previous experiments by achieving dynamical control of the underlying graph structure. We demonstrate the evolution of an optical time-multiplexed quantum wa…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear and disappear randomly in each step during the time evolution. The resulting open system dynamics is hard to treat numerically in general. We shortly review the literature on this problem. We then present our method to solve the evolution on finite percolation graphs in the long time limit, applying the asymptotic methods concerning random unitary maps. We …
We address continuous-time quantum walks on graphs in the presence of time- and space-dependent noise. Noise is modeled as generalized dynamical percolation, i.e. classical time-dependent fluctuations affecting the tunneling amplitudes of the walker. In order to illustrate the general features of the model, we review recent results on two paradigmatic examples: the dynamics of quantum walks on the line and the effects of noise on the performances of quantum spatial search on the complete and the star graph. We also discuss future perspectives, including extension to many-particle quantum walk,…
Quantum walks obey unitary dynamics: they form closed quantum systems. The system becomes open if the walk suffers from imperfections represented as missing links on the underlying basic graph structure, described by dynamical percolation. Openness of the system's dynamics creates decoherence, leading to strong mixing. We present a method to analytically solve the asymptotic dynamics of coined, percolated quantum walks for a general graph structure. For the case of a circle and a linear graph we derive the explicit form of the asymptotic states. We find that a rich variety of asymptotic evolut…
We study the time evolution of continuous-time quantum walks on randomly changing graphs. At certain moments edges of the graph appear or disappear with a given probability. We focus on the case when the time interval between subsequent changes of the graph tends to zero. We derive explicit formulae for the general evolution in this limit. We find that the percolation in this limit causes an effective time rescaling. Independently of the graph and the initial state of the walk, the time is rescaled by the probability of keeping and edge. Both the individual trajectories for a single system and…
We study the entanglement dynamics in a generic quantum automaton circuit subjected to projective measurements. We design an efficient algorithm which not only allows us to perform large scale simulation for the Rényi entropy but also provides a physical picture for the entanglement dynamics, which can be interpreted in terms of a classical bit-string model which belongs to the directed percolation universality class. We study the purification dynamics of a state formed by EPR pairs, and the growth of entanglement starting from a product state. In both cases, we verify numerically that the dyn…
We investigate the critical behavior of the entanglement transition induced by projective measurements in (Haar) random unitary quantum circuits. Using a replica approach, we map the calculation of the entanglement entropies in such circuits onto a two-dimensional statistical mechanics model. In this language, the area- to volume-law entanglement transition can be interpreted as an ordering transition in the statistical mechanics model. We derive the general scaling properties of the entanglement entropies and mutual information near the transition using conformal invariance. We analyze in det…
We investigate entanglement distribution in pure-state quantum networks. We consider the case when non-maximally entangled two-qubit pure states are shared by neighboring nodes of the network. For a given pair of nodes, we investigate how to generate the maximal entanglement between them by performing local measurements, assisted by classical communication, on the other nodes. We find optimal measurement protocols for both small and large 1D networks. Quite surprisingly, we prove that Bell measurements are not always the optimal ones to perform in such networks. We generalize then the results …
Coherent transport of excitations along chains of coupled quantum systems represents an interesting problem with a number of applications ranging from quantum optics to solar cell technology. A convenient tool for studying such processes are quantum walks. They allow to determine in a quantitative way all the process features. We study the survival probability and the transport efficiency on a simple, highly symmetric graph represented by a ring. The propagation of excitation is modeled by a discrete-time (coined) quantum walk. For a two-state quantum walk, where the excitation (walker) has to…
One goal in the quantum-walk research is the exploitation of the intrinsic quantum nature of multiple walkers, in order to achieve the full computational power of the model. Here we study the behaviour of two non-interacting particles performing a quantum walk on the line when the possibility of lattice imperfections, in the form of missing links, is considered. We investigate two regimes, statical and dynamical percolation, that correspond to different time scales for the imperfections evolution with respect to the quantum-walk one. By studying the qualitative behaviour of three two-particle …
In two-dimensional quantum site-percolation square lattice models, the von Neumann entropy is extensively studied numerically. At a certain eigenenergy, the localization-delocalization transition is reflected by the derivative of von Neumann entropy which is maximal at the quantum percolation threshold $p_q$. The phase diagram of localization-delocalization transitions is deduced in the extrapolation to infinite system sizes. The non-monotonic eigenenergies dependence of $p_q$ and the lowest value $p_q\simeq0.665$ are found. At localized-delocalized transition points, the finite scaling analys…
Continuous-time quantum walks may be exploited to enhance spatial search, i.e., for finding a marked element in a database structured as a complex network. However, in practical implementations, the environmental noise has detrimental effects, and a question arises on whether noise engineering may be helpful in mitigating those effects on the performance of the quantum algorithm. Here we study whether time-correlated noise inducing non-Markovianity may represent a resource for quantum search. In particular, we consider quantum search on a star graph, which has been proven to be optimal in the …
This work is concerned with phrasing the concepts of fault-tolerant quantum computation within the framework of disordered systems, Bernoulli site percolation in particular. We show how the so-called "threshold theorems" on the possibility of fault-tolerant quantum computation with constant error rate can be cast as a renormalization (coarse-graining) of the site percolation process describing the occurrence of errors during computation. We also use percolation techniques to derive a trade-off between the complexity overhead of the fault-tolerant circuit and the threshold error rate.
We examine the dynamics of a $(1+1)$-dimensional measurement-only circuit defined by the stabilizers of the [[5,1,3]] quantum error correcting code interrupted by single-qubit Pauli measurements. The code corrects arbitrary single-qubit errors and it stabilizes an area law entangled state with a $D_2 = \mathbb{Z}_2 \times \mathbb{Z}_2$ symmetry protected topological (SPT) order, as well as a symmetry breaking (SB) order from a two-fold bulk degeneracy. The Pauli measurements break the topological order and induce a phase transition into a trivial area law phase. Allowing more than one type of …
Percolation, describing critical behaviors of phase transition in a geometrical context, prompts wide investigations in natural and social networks as a fundamental model. The introduction of quantum-intrinsic interference and tunneling brings percolation into quantum regime with more fascinating phenomena and unique features, which, however, hasn't been experimentally explored yet. Here we present an experimental demonstration of quantum transport in hexagonal percolation lattices by successfully mapping such large-scale porous structures into a photonic chip using femtosecond laser direct wr…
Any quantum algorithm can be implemented by an adaptive sequence of single node measurements on an entangled cluster of qubits in a square lattice topology. Photons are a promising candidate for encoding qubits but assembling a photonic entangled cluster with linear optical elements relies on probabilistic operations. Given a supply of $n$-photon-entangled microclusters, using a linear optical circuit and photon detectors, one can assemble a random entangled state of photons that can be subsequently "renormalized" into a logical cluster for universal quantum computing. In this paper, we prove …
Entanglement distribution is key to the success of secure communication schemes based on quantum mechanics, and there is a strong need for an ultimate architecture able to overcome the limitations of recent proposals such as those based on entanglement percolation or quantum repeaters. In this work we provide broad theoretical background for the development of such technologies. In particular, we investigate the question of whether entanglement distribution is more efficient if some amount of entanglement -- or some amount of correlations in general -- is available prior to the transmission st…
We estimate the critical thresholds of bond and site percolation on nonplanar, effectively two-dimensional graphs with chimera like topology. The building blocks of these graphs are complete and symmetric bipartite subgraphs of size $2n$, referred to as $K_{n,n}$ graphs. For the numerical simulations we use an efficient union-find based algorithm and employ a finite-size scaling analysis to obtain the critical properties for both bond and site percolation. We report the respective percolation thresholds for different sizes of the bipartite subgraph and verify that the associated universality c…
We analyze several high dimensional generalizations of the toric code at nonzero temperature. We find that in large enough dimension, there can be a distinct separation between the critical temperature $T_c$, given by thermodynamic singularities, and the percolation temperature $T_p$, given by the percolation of defects. We argue that the regime $T_p<T<T_c$ is a range of temperatures where a self-correcting quantum memory can operate despite having percolating defects. We present analytic arguments and numerical evidence in support of this scenario, including a mean-field treatment and Monte C…
We study how to protect quantum information in quantum systems subjected to local dissipation. We show that combining the use of three-level systems, environment monitoring, and local feedback can fully and deterministically protect any available quantum information, including entanglement initially shared by different parties. These results can represent a gain in resources and/or distances in quantum communication protocols such as quantum repeaters and teleportation as well as time for quantum memories. Finally, we show that monitoring local environments physically implements the optimum si…
We study the percolation of a quantum particle on quasicrystal lattices and compare it with the square lattice. For our study, we have considered quasicrystal lattices modelled on the pentagonally symmetric Penrose tiling and the octagonally symmetric Ammann-Beenker tiling. The dynamics of the quantum particle is modelled using continuous-time quantum walk (CTQW) formalism. We present a comparison of the behaviour of the CTQW on the two aperiodic quasicrystal lattices and the square lattice when all the vertices are connected and when disorder is introduced in the form of disconnections betwee…
Flow to Nishimori universality in weakly monitored quantum circuits with qubit loss
University of Cologne（科隆大学）；University of Geneva（日内瓦大学）；University of California, Santa Barbara（加州大学圣塔芭芭拉分校）；The Hong Kong University of Science and Technology (Guangzhou)（香港科技大学（广州））
Probabilistic cellular automata (CA) provides a classic framework for studying non-equilibrium statistical physics on a lattices. A notable example is the Domany-Kinzel CA, which has been used to investigate the process of directed percolation and the critical dynamics of the non-equilibrium phase transition betweeen absorbing and percolating phases. In this work, we construct a non-unitary Quantum Cellular Automaton that generalises the Domany-Kinzel cellular automaton and study the resulting dynamical evolution using the numerical simulations using the tensor network iTEBD algorithm. We demo…
