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

Chinese Physics Letters

Simulating Entangling Unitary Operator Using Non-maximally Entangled States

Chun-Xian Li, Wang Cheng-Zhi, Nie Liu-Ying, Jiangfan Li

Published Feb 1, 2009• 0 citations
Publisher

Abstract

We use non-maximally entangled states (NMESs) to simulate an entangling unitary operator (EUO) with a certain probability. Given entanglement resources, the probability of the success we achieve is a decreasing function of the parameters of the EUO. Given an EUO, for certain entanglement resources the result is optimal, i.e., the probability obtains a maximal value, and for optimal result higher parameters of the EUO match more amount of entanglement resources. The probability of the success we achieve is higher than the known results under some condition.

DOI
10.1088/0256-307x/26/2/020303

Related papers

Optimal simulation of a perfect entangler

Nengkun Yu, Runyao Duan, Mingsheng Ying

A $2\ensuremath{\bigotimes}2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation are required to simulate some perfect entangler with one-qubit unitary operations as free resources? We completely solve this problem by presenting an analytical formula for the optimal number of runs of the entangling operation. Our result reveals an entanglement strength of two-qubit unitary operations.

arXiv:0907.2733•Physical Review A•Mar 29, 2010•8 citations

Probabilistic Dense Coding Using Non-maximally Entangled State Between Multiparticles

Mei Wang

A scheme for probabilistic dense coding between multiparties by an N+1particle nonmaximally entangled state is proposed.By introducing an auxiliary particle and performing a collective unitary operation, quantum dense coding will be succeeded with certain probability.

Journal of Hebei Normal University•Jan 1, 2003•0 citations

Quantum Entanglement Simulation: A Non-Asymptotic Analysis and Novel Simulation Method

Jincheng Zhang

Quantum entanglement, a fundamental phenomenon in quantum mechanics, holds immense potential for advanced computational modeling. This research explores the use of quantum entanglement simulation to analyze non-asymptotic properties of entangled systems, aiming to overcome limitations inherent in traditional simulation techniques. We propose a novel simulation algorithm that directly leverages entanglement's unique characteristics, enhancing precision and reducing latency. This work presents a framework for high-fidelity quantum simulations based on entangled states, demonstrating the efficacy of this approach through a rigorous theoretical analysis and preliminary experimental validation. The core claim is that this method offers a significant advancement in quantum computation, particularly in scenarios requiring high accuracy and low computational cost.

•Sep 5, 2026•0 citations

Probabilistic Teleportation of Three-Atom State via Five-Atom Cluster State

Lizhi Yu, Tao Wu

A scheme for probabilistic teleportation of an unknown three-atom entangled state via a five-atom non-maximally entangled cluster state as quantum channel is proposed. In this scheme, the sender performs two Bell state and a single-atom measurements on the atoms, the receiver can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating appropriate unitary transformations and controlled-not (C-not) operations according to the sender Alice's measurement results. As a result, the probability of successful teleportation is determined by the smallest two of the coefficients' absolute values of the cluster state. The considerable advantage of our scheme is that we employ a non-maximally entangled cluster state as quantum channel in the scheme, which can greatly reduce the amount of entanglement resources and need less classical bits. If we employ a maximally entangled cluster state as quantum channel, the probabilistic teleportation scheme becomes usual teleportation, the successful probability being 100%.

Communications in Theoretical Physics•Jun 1, 2013•3 citations

Probabilistic teleportation of arbitrary two-particle entangled state via cluster state

NI Zhi-xiang

Two schemes for teleporting an unknown two-particle entangled state via a four-qubit non-maximally entangled cluster state as quantum channel are proposed.In the first scheme,a special bipartite entangled state was teleported,the receiver Bob can reconstruct the original state with a certain probability according to the sender Alice's measurement results,and the successful probability is determined by the smallest two coefficients' absolute values of the cluster state.In the latter scheme an arbitrary two-particle entangled state was teleported.Contrast to the first scheme, Bob should perform a quantum controlled phase gate operation besides the unitary transformation. The considerable advantage is that it employs a non-maximally entangled cluster state as quantum channel in these two schemes.Thus,the schemes can greatly reduce the amount of entanglement resources and need less classical bits.

Chinese Journal of Quantum Electronics•Jan 1, 2010•0 citations

Physics Simulation of Quantum Entanglement Optimization – Optimization of Quantum Entanglement States

Jincheng Zhang

Quantum entanglement, a bizarre phenomenon in which two or more particles become linked in such a way that they share the same fate, holds immense promise for quantum computing and quantum information processing. However, harnessing entanglement effectively requires precise control over its quantum states. This paper explores the application of physics simulation techniques to optimize quantum entanglement states, specifically focusing on a novel geometric optimization method leveraging the unique properties of entanglement. Traditional optimization methods struggle to fully capture the intricacies of entangled states, necessitating a shift towards a more sophisticated approach. We propose a new method that utilizes entanglement to guide the search for optimal quantum states, resulting in enhanced efficiency and control over quantum computation. The core claim is that this method provides a significant improvement in the performance of quantum algorithms by effectively manipulating entangled states. The mechanism involves the exploitation of entanglement's non-classical correlation to generate a more complex and structured quantum state, facilitating faster and more accurate computations. This research presents a theoretical framework and preliminary results demonstrating the effectiveness of this approach.

•Aug 31, 2026•0 citations
We use non-maximally entangled states (NMESs) to simulate an entangling unitary operator (EUO) with a certain probability. Given entanglement resources, the probability of the success we achieve is a decreasing function of the parameters of the EUO. Given an EUO, for certain entanglement resources the result is optimal, i.e., the probability obtains a maximal value, and for optimal result higher parameters of the EUO match more amount of entanglement resources. The probability of the success we achieve is higher than the known results under some condition.
A $2\ensuremath{\bigotimes}2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation are required to simulate some perfect entangler with one-qubit unitary operations as free resources? We completely solve this problem by presenting an analytical formula for the optimal number of runs of the entangling operation. Our result reveals an entanglement strength of two-qubit unitary operations.
Quantum entanglement, a fundamental phenomenon in quantum mechanics, holds immense potential for advanced computational modeling. This research explores the use of quantum entanglement simulation to analyze non-asymptotic properties of entangled systems, aiming to overcome limitations inherent in traditional simulation techniques. We propose a novel simulation algorithm that directly leverages entanglement's unique characteristics, enhancing precision and reducing latency. This work presents a framework for high-fidelity quantum simulations based on entangled states, demonstrating the efficacy of this approach through a rigorous theoretical analysis and preliminary experimental validation. The core claim is that this method offers a significant advancement in quantum computation, particularly in scenarios requiring high accuracy and low computational cost.
A scheme for probabilistic teleportation of an unknown three-atom entangled state via a five-atom non-maximally entangled cluster state as quantum channel is proposed. In this scheme, the sender performs two Bell state and a single-atom measurements on the atoms, the receiver can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating appropriate unitary transformations and controlled-not (C-not) operations according to the sender Alice's measurement results. As a result, the probability of successful teleportation is determined by the smallest two of the coefficients' absolute values of the cluster state. The considerable advantage of our scheme is that we employ a non-maximally entangled cluster state as quantum channel in the scheme, which can greatly reduce the amount of entanglement resources and need less classical bits. If we employ a maximally entangled cluster state as quantum channel, the probabilistic teleportation scheme becomes usual teleportation, the successful probability being 100%.
Two schemes for teleporting an unknown two-particle entangled state via a four-qubit non-maximally entangled cluster state as quantum channel are proposed.In the first scheme,a special bipartite entangled state was teleported,the receiver Bob can reconstruct the original state with a certain probability according to the sender Alice's measurement results,and the successful probability is determined by the smallest two coefficients' absolute values of the cluster state.In the latter scheme an arbitrary two-particle entangled state was teleported.Contrast to the first scheme, Bob should perform a quantum controlled phase gate operation besides the unitary transformation. The considerable advantage is that it employs a non-maximally entangled cluster state as quantum channel in these two schemes.Thus,the schemes can greatly reduce the amount of entanglement resources and need less classical bits.
Quantum entanglement, a bizarre phenomenon in which two or more particles become linked in such a way that they share the same fate, holds immense promise for quantum computing and quantum information processing. However, harnessing entanglement effectively requires precise control over its quantum states. This paper explores the application of physics simulation techniques to optimize quantum entanglement states, specifically focusing on a novel geometric optimization method leveraging the unique properties of entanglement. Traditional optimization methods struggle to fully capture the intricacies of entangled states, necessitating a shift towards a more sophisticated approach. We propose a new method that utilizes entanglement to guide the search for optimal quantum states, resulting in enhanced efficiency and control over quantum computation. The core claim is that this method provides a significant improvement in the performance of quantum algorithms by effectively manipulating entangled states. The mechanism involves the exploitation of entanglement's non-classical correlation to generate a more complex and structured quantum state, facilitating faster and more accurate computations. This research presents a theoretical framework and preliminary results demonstrating the effectiveness of this approach.