<p>In this paper, we deal with two problems of quantum operation sharing, which is the remote implementation of quantum operations on qubits held at distant places by one of the many possible receivers. It is a combination of quantum secret sharing and quantum operator teleportation. We perform it on single-qubit and two-qubit systems. The operations are partially unknown and are collected from specific sets of unitary operators. We use maximally entangled states as our quantum resources. Moreover, there is a hierarchy of receivers by which the securities of the protocols are enhanced. We have investigated the performance of one of our protocols under various quantum noise channels, including amplitude damping (AD), phase damping (PD), bit-flip (BF), phase-flip (PF) and depolarizing (DP) channels. The fidelity of the protocol is calculated for each noise type, showing maximum values of 1 in all cases, while the minimum fidelity varies: 0 for AD, BF and PF noise; 0.5 for PD noise; and 0.25 for DP noise. We have simulated one of our protocols on the Qiskit platform. A statistical analysis of the results obtained from the simulation indicates that the standard deviation of the probabilities <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4867_Article_IEq1.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">$P(|0\rangle )$</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>P</mi> <mo stretchy="false">(</mo> <mo stretchy="false">|</mo> <mn>0</mn> <mo stretchy="false">⟩</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4867_Article_IEq2.gif" Format="GIF" Height="19" Rendition="HTML" Resolution="72" Type="Linedraw" Width="47" /> </InlineMediaObject> <EquationSource Format="TEX">$P(|1\rangle )$</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>P</mi> <mo stretchy="false">(</mo> <mo stretchy="false">|</mo> <mn>1</mn> <mo stretchy="false">⟩</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> decreases with increased number of shots.</p>

Hierarchical quantum operation sharing of single- and two-qubit partially unknown quantum operations

期刊论文
发表日期：

2025年8月6日

查看全文

Plaban Saha,
Manoj Kumar Mandal,
Binayak S. Choudhury

摘要

In this paper, we deal with two problems of quantum operation sharing, which is the remote implementation of quantum operations on qubits held at distant places by one of the many possible receivers. It is a combination of quantum secret sharing and quantum operator teleportation. We perform it on single-qubit and two-qubit systems. The operations are partially unknown and are collected from specific sets of unitary operators. We use maximally entangled states as our quantum resources. Moreover, there is a hierarchy of receivers by which the securities of the protocols are enhanced. We have investigated the performance of one of our protocols under various quantum noise channels, including amplitude damping (AD), phase damping (PD), bit-flip (BF), phase-flip (PF) and depolarizing (DP) channels. The fidelity of the protocol is calculated for each noise type, showing maximum values of 1 in all cases, while the minimum fidelity varies: 0 for AD, BF and PF noise; 0.5 for PD noise; and 0.25 for DP noise. We have simulated one of our protocols on the Qiskit platform. A statistical analysis of the results obtained from the simulation indicates that the standard deviation of the probabilities $P(|0\rangle )$ $P (| 0 ⟩)$ and $P(|1\rangle )$ $P (| 1 ⟩)$ decreases with increased number of shots.