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

AAPPS bulletin

Perfect NOT and conjugate transformations

Fengli Yan, Ting Gao

Published Mar 15, 2022• 8 citations
Publisher

Abstract

Abstract We obtain the perfect NOT transformation criteria, two necessary and sufficient conditions for realizing a perfect NOT transformation on a quantum state set S of a qubit. Furthermore, we discuss a probabilistic perfect NOT transformation when there is no perfect NOT transformation on a state set S. We also generalize the perfect NOT transformation to the conjugate transformation in the multi-level quantum system and a lower bound of the best possible efficiencies attained by a probabilistic perfect conjugate transformation are obtained.

DOI
10.1007/s43673-022-00038-3

Related papers

Perfect NOT transformation and conjugate transformation

Fengli Yan, Ting Gao, Zhichao Yan

The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set $S$ of a qubit are obtained. Two necessary and sufficient conditions for realizing a perfect NOT transformation on $S$ are derived. When these conditions are not satisfied we discuss a probabilistic perfect NOT transformation (gate). We construct a probabilistic perfect NOT machine (gate) by a general unitary-reduction operation. With a postselection of the measurement outcomes, the probabilistic NOT gate yields perfectly complements of the input states. We prove that one can realize probabilistically the NOT gate of the input states secretly chosen from a certain set $S=\{|Ψ_1>, |Ψ_2>,..., |Ψ_n>\}$ if and only if $|Ψ_1>, |Ψ_2>,...,$ and $|Ψ_n>$ are linearly independent. We also generalize the probabilistic NOT transformation to the conjugate transformation in the multi-level quantum system. The lower bound of the best possible efficiencies attained by a probabilistic perfect conjugate transformation are obtained.

arXiv:1203.0350•Mar 2, 2012•0 citations

Perfect Probabilistic Transformations between Symmetric Sets of Quantum States

Erika Andersson, Vedran Dunjko

We study probabilistic transforms between sets of quantum states. An example is a multiprobabilistic transform from symmetric coherent states to symmetric qubit states. We suggest an asymptotically optimal linear optical realization based on quantum scissors.

Research in Optical Sciences•Jan 1, 2012•0 citations

Phase conjugation of continuous quantum variables

Nicolas J. Cerf, S. Iblisdir

The phase conjugation of an unknown Gaussian state cannot be realized perfectly by any physical process. A heuristic argument is used to derive a tight lower bound on the noise that must be introduced by an approximate phase conjugation operation. A universal transformation achieving the optimal imperfect phase conjugation is then presented, which is the continuous counterpart of the universal-NOT transformation for quantum bits. In addition, it is shown that more information can be encoded into a pair of conjugate Gaussian states than by using the same state twice.

arXiv:quant-ph/0012020•Physical Review A•Aug 17, 2001•43 citations

Engineering Perfect State Transfer Graphs via Givens Transformations

Pablo Serra, Alejandro Ferrón, Omar Osenda

Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with homogeneous interactions. These restrictions allow finding numerous examples of systems that show perfect transfer but in geometries that are not implementable or are very difficult to implement in actual experimental settings. Relaxing the homogeneity of the interactions and inspired by the $XX$ qubit chains that show perfect transmission, we present a simple scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission. We present some simple examples and show how it is possible to generalize them for longer transmission lengths.

quant-pharXiv:2604.02536•Journal of Physics A Mathematical and Theoretical•Apr 6, 2026•0 citations

On the existence of physical transformations between sets of quantum states

Anthony Chefles, Richard Jozsa, Andreas Winter +1 more

Let A = {rho_1,...,rho_n} be a given set of quantum states. We consider the problem of finding necessary and sufficient conditions on another set B = {sigma_1,...,sigma_n} that guarantee the existence of a physical transformation taking rho_i to sigma_i for all i. Uhlmann has given an elegant such condition when both sets comprise pure states. We give a simple proof of this condition and develop some consequences. Then we consider multi-probabilistic transformations between sets of pure states which leads to conditions for the problem of transformability between A and B when one set is pure and the other is arbitrary.

•Jul 30, 2003•60 citations

ON THE EXISTENCE OF PHYSICAL TRANSFORMATIONS BETWEEN SETS OF QUANTUM STATES

ANTHONY CHEFLES, Richard Jozsa, Andreas Winter

Let A={ρ1,…,ρn} be a given set of quantum states. We consider the problem of finding necessary and sufficient conditions on another set B={σ1,…,σn} that guarantee the existence of a physical transformation taking ρi to σi for all i. Uhlmann has given an elegant such condition when both sets comprise pure states. We give a simple proof of this condition and develop some consequences. Then we consider multi-probabilistic transformations between sets of pure states which leads to conditions for the problem of transformability between A and B when one set is pure and the other is arbitrary.

arXiv:quant-ph/0307227•International Journal of Quantum Information•Mar 1, 2004•76 citations
Abstract We obtain the perfect NOT transformation criteria, two necessary and sufficient conditions for realizing a perfect NOT transformation on a quantum state set S of a qubit. Furthermore, we discuss a probabilistic perfect NOT transformation when there is no perfect NOT transformation on a state set S. We also generalize the perfect NOT transformation to the conjugate transformation in the multi-level quantum system and a lower bound of the best possible efficiencies attained by a probabilistic perfect conjugate transformation are obtained.
The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set SSS of a qubit are obtained. Two necessary and sufficient conditions for realizing a perfect NOT transformation on SSS are derived. When these conditions are not satisfied we discuss a probabilistic perfect NOT transformation (gate). We construct a probabilistic perfect NOT machine (gate) by a general unitary-reduction operation. With a postselection of the measurement outcomes, the probabilistic NOT gate yields perfectly complements of the input states. We prove that one can realize probabilistically the NOT gate of the input states secretly chosen from a certain set S={∣Ψ1>,∣Ψ2>,...,∣Ψn>}S=\{|Ψ_1>, |Ψ_2>,..., |Ψ_n>\}S={∣Ψ1​>,∣Ψ2​>,...,∣Ψn​>} if and only if ∣Ψ1>,∣Ψ2>,...,|Ψ_1>, |Ψ_2>,...,∣Ψ1​>,∣Ψ2​>,..., and ∣Ψn>|Ψ_n>∣Ψn​> are linearly independent. We also generalize the probabilistic NOT transformation to the conjugate transformation in the multi-level quantum system. The lower bound of the best possible efficiencies attained by a probabilistic perfect conjugate transformation are obtained.
The phase conjugation of an unknown Gaussian state cannot be realized perfectly by any physical process. A heuristic argument is used to derive a tight lower bound on the noise that must be introduced by an approximate phase conjugation operation. A universal transformation achieving the optimal imperfect phase conjugation is then presented, which is the continuous counterpart of the universal-NOT transformation for quantum bits. In addition, it is shown that more information can be encoded into a pair of conjugate Gaussian states than by using the same state twice.
Perfect quantum state transfer is achievable in different settings, including linear qubit chains, bi-dimensional arrays, ladders, etc. The most studied case contemplates transferring arbitrary one-qubit pure states in systems with homogeneous interactions. These restrictions allow finding numerous examples of systems that show perfect transfer but in geometries that are not implementable or are very difficult to implement in actual experimental settings. Relaxing the homogeneity of the interactions and inspired by the XXXXXX qubit chains that show perfect transmission, we present a simple scheme based on the Givens Transformations to analyse and obtain a class of qubit graphs that possess perfect quantum state transmission. We present some simple examples and show how it is possible to generalize them for longer transmission lengths.
Let A = {rho_1,...,rho_n} be a given set of quantum states. We consider the problem of finding necessary and sufficient conditions on another set B = {sigma_1,...,sigma_n} that guarantee the existence of a physical transformation taking rho_i to sigma_i for all i. Uhlmann has given an elegant such condition when both sets comprise pure states. We give a simple proof of this condition and develop some consequences. Then we consider multi-probabilistic transformations between sets of pure states which leads to conditions for the problem of transformability between A and B when one set is pure and the other is arbitrary.
Let A={ρ1,…,ρn} be a given set of quantum states. We consider the problem of finding necessary and sufficient conditions on another set B={σ1,…,σn} that guarantee the existence of a physical transformation taking ρi to σi for all i. Uhlmann has given an elegant such condition when both sets comprise pure states. We give a simple proof of this condition and develop some consequences. Then we consider multi-probabilistic transformations between sets of pure states which leads to conditions for the problem of transformability between A and B when one set is pure and the other is arbitrary.