Entanglement Resource Research Articles

Quantum Entanglement an Indispensable Tool of Quantum Teleportation

One of the most crucial procedures in quantum information is quantum teleportation. Quantum teleportation, which makes use of the physical resource of entanglement, is a fundamental primitive in many quantum information tasks and is a crucial component of quantum technologies. It is essential to the ongoing development of quantum networks, quantum computing, and quantum communication. Here, the practical applications of Bell states, algebra of entanglement, and quantum dense coding are highlighted. The fundamentals of quantum entanglement are described, along with its characteristics and the Einstein-Poldolsky-Rosen dilemma. By separating its distinctive properties, this paper demonstrated that teleportation will be used practically for quantum key distribution in the very near future. It also revealed the fundamental theoretical concepts behind quantum teleportation.

Locally distinguishing tripartite strongly nonlocal quantum states with entanglement resource

Locally distinguishing tripartite strongly nonlocal quantum states with entanglement resource

Mapping quantum circuits to shallow-depth measurement patterns based on graph states

Abstract The paradigm of measurement-based quantum computing (MBQC) starts from a highly entangled resource state on which unitary operations are executed through adaptive measurements and corrections ensuring determinism. This is set in contrast to the more common quantum circuit model, in which unitary operations are directly implemented through quantum gates prior to final measurements. In this work, we incorporate concepts from MBQC into the circuit model to create a hybrid simulation technique, permitting us to split any quantum circuit into a classically efficiently simulatable Clifford-part and a second part consisting of a stabilizer state and local (adaptive) measurement instructions—a so-called standard form—which is executed on a quantum computer. We further process the stabilizer state with the graph state formalism, thus, enabling a significant decrease in circuit depth for certain applications. We show that groups of mutually-commuting operators can be implemented using fully-parallel, i.e. non-adaptive, measurements within our protocol. In addition, we discuss how groups of mutually commuting observables can be simulatenously measured by adjusting the resource state, rather than performing a costly basis transformation prior to the measurement as it is done in the circuit model. Finally, we demonstrate the utility of our technique on two examples of high practical relevance—the Quantum Approximate Optimization Algorithm and the Variational Quantum Eigensolver (VQE) for the ground-state energy estimation of the water molecule. For the VQE, we find a reduction of the depth by a factor of 4 to 5 using measurement patterns vs. the standard circuit model. At the same time, since we incorporate the simultaneous measurements, our patterns allow us to save shots by a factor of at least 3.5 compared to measuring Pauli strings individually in the circuit model.

Locally distinguishing genuinely nonlocal sets with entanglement resource

A set of orthogonal product states is deemed genuinely nonlocal if they remain locally indistinguishable under any bipartition. In this paper, we first construct a genuinely nonlocal product basis B I(5, 3) in C5⨂C5⨂C5 using a set of nonlocal product states in C3⨂C4 . Then, we obtain a genuinely nonlocal product basis B II(5, 3) by replacing certain states in B I(5, 3) with some superposition states. We achieve perfect discrimination of the constructed genuinely nonlocal product basis, separately employing two EPR states and one GHZ state. Our protocol is more efficient than quantum teleportation.

Heralding entangled optical photons from a microwave quantum processor

Exploiting the strengths of different quantum hardware components may increase the capabilities of emerging quantum processors. Here we propose and analyze a quantum architecture that leverages the nonlocal connectivity of optics, along with the exquisite quantum control offered by superconducting microwave circuits, to produce entangled optical resource states. In contrast to previous proposals on optically distributing entanglement between superconducting microwave processors, we use squeezing between microwaves and optics to produce microwave-optical Bell pairs in a dual-rail encoding from a single microwave quantum processor. Moreover, the microwave quantum processor allows us to deterministically entangle microwave-optical Bell pairs into larger cluster states, from which entangled optical photons can be extracted through microwave measurements. Our scheme paves the way for small microwave quantum processors to create heralded entangled optical resource states for optical quantum computation, communication, and sensing using imperfect microwave-optics transducers. We expect that improved isolation of the superconducting processor from stray optical fields will allow the scheme to be demonstrated with currently available hardware. Published by the American Physical Society 2024

Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics.

We propose a fault-tolerant quantum computation scheme in a measurement-based manner with finite-sized entangled resource states and encoded-fusion scheme with linear optics. The encoded fusion is an entangled measurement devised to enhance the fusion success probability in the presence of losses and errors based on a quantum error-correcting code. We apply an encoded-fusion scheme, which can be performed with linear optics and active feedforwards to implement the generalized Shor code, to construct a fault-tolerant network configuration in a three-dimensional Raussendorf-Harrington-Goyal lattice based on the surface code. Numerical simulations show that our scheme allows us to achieve up to 10 times higher loss thresholds than nonencoded fusion approaches with limited numbers of photons used in fusion. Our scheme paves an efficient route toward fault-tolerant quantum computing with finite-sized entangled resource states and linear optics.

High-Photon-Loss Threshold Quantum Computing Using GHZ-State Measurements.

We propose fault-tolerant architectures based on performing projective measurements in the Greenberger-Horne-Zeilinger (GHZ) basis on constant-sized, entangled resource states. We present linear-optical constructions of the architectures, where the GHZ-state measurements are encoded to suppress the errors induced by photon loss and the probabilistic nature of linear optics. Simulations of our constructions demonstrate high single-photon-loss thresholds compared to the state-of-the-art linear-optical architecture realized with encoded two-qubit fusion measurements performed on constant-sized resource states. We believe this result shows a resource-efficient path to achieving photonic fault-tolerant quantum computing.

A new quantum secure multiparty summation protocol with locally indistinguishable orthogonal product states

As an important branch of quantum-secure multiparty computation, quantum-secure multiparty summation enables participants to complete the summation of their inputs without revealing their own secrets. In this paper, a new multiparty quantum secure summation protocol based on locally indistinguishable orthogonal product (LIOP) states is proposed. Leveraging the properties of LIOP states, participants can successfully accomplish the summation of their secrets with the assistance of a semi-honest third party (TP). The present protocol is shown to effectively resist certain existing attacks. Furthermore, complex operations and entanglement resources are not required in the proposed protocol. We anticipate that these results will contribute positively to the future development of quantum-secure multiparty computation.

Entanglement-invertible channels

In a well-known result [R. Werner, J. Phys. A: Math. Gen. 34(35), 7081 (2001)], Werner classified all tight quantum teleportation and dense coding schemes, showing that they correspond to unitary error bases. Here tightness is a certain dimensional restriction: the quantum system to be teleported and the entangled resource must be of dimension d, and the measurement must have d2 outcomes. Here we generalise this classification so as to remove the dimensional restriction altogether, thereby resolving an open problem raised in that work. In fact, we classify not just teleportation and dense coding schemes, but entanglement-reversible channels. These are channels between finite-dimensional C*-algebras which are reversible with the aid of an entangled resource state, generalising ordinary reversibility of a channel. We show that such channels correspond to families of linear maps which are bi-isometric with respect to a duality defined by the resource state. In particular, in Werner’s classification, a bijective correspondence between tight teleportation and dense coding schemes was shown: swapping Alice and Bob’s operations turns a teleportation scheme into a dense coding scheme and vice versa. We observe that this property generalises ordinary invertibility of a channel; we call it entanglement-invertibility. We show that entanglement-invertible channels are precisely the quantum bijections previously studied in noncommutative topology [B. Musto et al., J. Math. Phys. 59(8), 081706 (2018)], and therefore admit a classification in terms of Wang’s quantum permutation group [S. Wang, Commun. Math. Phys. 195, 195–211 (1998)].

Overcoming noise in quantum teleportation with multipartite hybrid entanglement.

Quantum entanglement and decoherence are the two counterforces of many quantum technologies and protocols. For example, while quantum teleportation is fueled by a pair of maximally entangled resource qubits, it is vulnerable to decoherence. Here, we propose an efficient quantum teleportation protocol in the presence of pure decoherence and without entangled resource qubits entering the Bell-state measurement. Instead, we use multipartite hybrid entanglement between the auxiliary qubits and their local environments within the open-quantum system context. With a hybrid-entangled initial state, it is the decoherence that allows us to achieve high fidelities. We demonstrate our protocol in an all-optical experiment.

Enhancing hierarchical remote preparation of an arbitrary n-qudit equatorial state by weak measurement and measurement reversal

Based on the demand for safer and more efficient quantum network communication, we propose two deterministic protocols to achieve the remote preparation of an arbitrary n-qudit equatorial states among multiple agents by selecting appropriate entanglement resources. The level of the agents varies depending on their authorities to restore the secret state. The superior agent requires the cooperation of the residual superior agents and any one of the subordinate agents, while the subordinate agent needs the help of all the other agents. To be emphasized, the recovery operations are deduced by general formulas that distinctly elucidate their relevance with the measurement outcomes. Additionally, we discuss the impact of amplitude damping noise and utilize weak measurement and measurement reversal to suppress noise.

Enhancement of teleportation average fidelity via photon addition operation

In this paper, using the linear entropy criterion to quantify the degree of entanglement, we demonstrate that the addition of photons can enhance the entanglement degree of the photon-added two-mode squeezed vacuum states (PATMSVSs). Besides, the entanglement degree can approach ideal in case of squeezing parameter or number of added photons is high. When using PATMSVSs as entanglement resources to teleport a coherent state via a canonical protocol, the results show that the average fidelity of the quantum teleportation process is enhanced by the photon addition operation. The average fidelity increases as the number of photons added to the two-mode increases. In addition, we show that an enhancement in average fidelity can also be achieved by increasing the squeezing parameter of the TMSVS.

Photonic Non‐Markovianity Identification by Quantum Process Capabilities of Non‐CP Processes

AbstractA Markovian quantum process can be arbitrarily divided into two or more legitimate completely‐positive (CP) subprocesses. When at least one non‐CP process exists among the divided processes, the dynamics is considered non‐Markovian. However, how to utilize minimum experimental efforts, without examining all process input states and using entanglement resources, to identify or measure non‐Markovianity is still being determined. Herein, a method is proposed to quantify non‐CP processes for identifying and measuring non‐Markovianity without the burden of state optimization and entanglement. This relies on the non‐CP processes as new quantum process capabilities and can be systematically implemented by quantum process tomography. Additionally, an approach for witnessing non‐Markovianity by analyzing at least four system states without process tomography is provided. It is faithfully demonstrated that this method can be explicitly implemented using all‐optical setups and applied to identify the non‐Markovianity of single‐photon and two‐photon dynamics in birefringent crystals. The results also can be used to explore non‐Markovianity in other dynamical systems where process or state tomography is implementable.

Broadband detection of 18 teeth in an 11-dB squeezing comb

Squeezed vacuum is a versatile resource of bipartite entanglement for quantum metrology and information. Optical parametric oscillators generate these states in a frequency comb structure. We show the simultaneous detection of 18 teeth with 11 dB of squeezing each. We built a 1.5-m-long optical resonator to increase the spectral teeth density and significantly increase the detection bandwidth by employing unbalanced homodyne detection instead of balanced. Our approach can be a crucial step in using the scaling potential of high-frequency squeezed states in quantum information. Published by the American Physical Society 2024

Entanglement-symmetries of covariant channels

Let G and G′ be monoidally equivalent compact quantum groups, and let H be a Hopf-Galois object realising a monoidal equivalence between these groups' representation categories. This monoidal equivalence induces an equivalence Chan(G) → Chan(G′), where Chan(G) is the category whose objects are finite-dimensional C∗-algebras with an action of G and whose morphisms are covariant channels. We show that, if the Hopf-Galois object H has a finite-dimensional *-representation, then channels related by this equivalence can simulate each other using a finite-dimensional entangled resource. We use this result to calculate the entanglement-assisted capacities of certain quantum channels.

Multi‐hop joint remote state preparation of general hybrid entangled multi‐qudit states via distinct Einstein‐Podolsky‐Rosen channels

AbstractJoint Remote State Preparation provides a useful way to securely transfer the known quantum states to the distant nodes. However, the limitation of resources often leads to the quantum channels constructed by distributed entangled pairs being incompatible with the transmitted states. In order to overcome this problem, a novel Joint Remote State Preparation protocol was proposed for transmitting general multi‐qudit states over quantum networks, providing a promising pathway to utilise the available Einstein‐Podolsky‐Rosen (EPR) channels with different levels. Several scenarios under noisy environments were discussed and some properties of the fidelity when transmitting the multi‐qudit state were demonstrated. It was demonstrated that both the prepared state and the kind of the noises could restrict the number of the participant nodes. Our scheme leverages the existing quantum resources, which addresses the issue of insufficient entanglement resources. This approach is easily adaptable to other quantum network structures, offering a potential solution for constructing a universal quantum network.

Measurement-based quantum computation in finite one-dimensional systems: string order implies computational power

We present a new framework for assessing the power of measurement-based quantum computation (MBQC) on short-range entangled symmetric resource states, in spatial dimension one. It requires fewer assumptions than previously known. The formalism can handle finitely extended systems (as opposed to the thermodynamic limit), and does not require translation-invariance. Further, we strengthen the connection between MBQC computational power and string order. Namely, we establish that whenever a suitable set of string order parameters is non-zero, a corresponding set of unitary gates can be realized with fidelity arbitrarily close to unity.

Swapping-Based Entanglement Routing Design for Congestion Mitigation in Quantum Networks

The quantum network is designed to connect numerous quantum nodes and support various ground-breaking quantum applications. Most of these applications require communicating parties to share entangled pairs. Therefore, entanglement routing, a technology distributing entangled pairs between distant quantum nodes, plays a vital role in realizing quantum networks’ capability. However, due to the limitation of quantum memory size and quantum decoherence, the entangled pairs shared by adjacent quantum nodes can hardly satisfy concurrent entanglement routing requests, thus leading to severe network congestion. In this paper, we propose a novel congestion mitigation (CM) scheme to tackle such bottleneck problems. The basic idea of CM is to “recycle” idle link-level entanglement resources from well-resourced links to bottleneck links utilizing a unique enabling technology of quantum networks, called entanglement swapping. CM can increase the capacity of each bottleneck link, thus overcoming resource limitations to improve resource utilization and network throughput. To complete our work, we also propose a swapping-based entanglement routing design, including path selection and resource allocation algorithms. Extensive simulations show that our design can significantly alleviate network congestion and improve the request service rate of quantum networks compared to the traditional entanglement routing designs.

Underwater quantum key distribution with continuous-variable via photon additions

Quantum key distribution with continuous-variable (CVQKD) provides an alternative way for the security improvement of underwater optical communication, but facing into the awkward situation of short distance. For this reason, here we exploit photon addition operation at the emitter into enhancing the performance of underwater CVQKD. Based on numerical simulation, it is shown that applying photon-addition non-Gaussian operation between entangled resource and the sender can further enhance both the secure key rate and the transmission distance, compared to apply photon subtraction operation between entangled resource and the receiver. In addition, the influence of seawater quality factors in underwater CVQKD system is also considered, so as to provide technical support for underwater safety communication.

Numerical Simulation of Optimal Entanglement Network Protocols for Multiple States

Abstract: Entanglement has been one of the dominant aspects distinguishing quantum theory from its classical counterpart. Indeed, entanglement has played a central role in recent developments in quantum technology, such as quantum computing, key distribution, etc. In order to use entanglement in these situations, a particular form is often needed, namely the maximal case. Various techniques have been used to manipulate entangled states, especially between distant parties. Generating long-distance entanglement from multiple shorter states has been studied, and it has been shown that there exists a class of states that can achieve optimal entanglement resources. In this paper, the particular class of states that yields the weakest link is numerically examined. The findings reveal that the range of this class is limited but substantial. Keywords: Quantum entanglement, Numerical methods, Maximal states.