Parallel self‐testing for device‐independent verifiable blind quantum computation

Xu, Qingshan; Tan, Xiaoqing; Huang, Rui; Zeng, Xiaodan

doi:10.1002/que2.51

Cited by 8 publications

(5 citation statements)

References 45 publications

(78 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kashef and Wallden proposed an optimised resource construction method for verifable universal BQC protocol [25], where the overhead is linear in the size of the computation. In addition, some BQC protocols also have been put forward by combining other properties, such as BQC with identity authentication [27,28], device-independence BQC [29][30][31], and blind oracular quantum computation [32].…”

Section: Introductionmentioning

confidence: 99%

Verifiable Multiparty Delegated Quantum Computation

Wang

Zhu

et al. 2023

International Journal of Intelligent Systems

View full text Add to dashboard Cite

Multiparty delegated quantum computation (MDQC) allows multiple clients with limited quantum capability to jointly complete a quantum computational task with the aid of an untrusted quantum server. But in existing MDQC protocols, the verifiability that clients should verify whether the server executed the protocol correctly and gave correct results was not handled. Therefore, in this paper, we improve a typical MDQC protocol to enable clients to verify the correctness of computation by inserting trap qubits and develop a novel method to enforce clients to send qubits honestly while avoiding the positions of trap qubits being leaked to the server. The security and verifiability of the improved MDQC protocol are also analyzed. In addition, a specific example of the proposed verifiable MDQC protocol is given and simulated on IBM’s quantum platform.

show abstract

Section: Introductionmentioning

confidence: 99%

Verifiable Multiparty Delegated Quantum Computation

Wang

Zhu

et al. 2023

International Journal of Intelligent Systems

View full text Add to dashboard Cite

show abstract

“…In an entangled physical system, even at distant spatial distances, the quantum nonlocal correlation among the particles still exists 1 . Taking advantage of this nonlocality, quantum entanglement is an important resource in quantum computation 2‐8 and quantum communication fields, such as quantum teleportation, 9,10 quantum key distribution, 11,12 quantum secure direct communication, 13‐17 quantum machine learning, 18 and so on 19 …”

Section: Introductionmentioning

confidence: 99%

Logic W‐state concentration with parity check

Zhou

Liu

et al. 2021

Quantum Engineering

View full text Add to dashboard Cite

Logic W state, which replaces each physical qubit in a W state with a Greenberger–Horne–Zeilinger state is robust against photon transmission loss in long‐distance quantum communication. In practical application, the environmental noise may make maximally entangled logic W state degrade to less entangled state, which largely limits its application. In this article, we propose an efficient entanglement concentration protocol (ECP) for logic W state, which can recover the less entangled logic W state into the maximally entangled logic W state. Our ECP relies on the nondemolition polarization parity check (PPC) gate constructed with cross‐Kerr nonlinearity. The distilled maximally entangled logic W state can be preserved for other application. Moreover, when the ECP fails, we can repeat the ECP to further concentrate the distilled less entangled logic W state. By repeating the ECP, the total success probability can be effectively increased. Based on above features, this ECP may be useful in quantum communication field.

show abstract

“…Due to insufficient quantum capability of the client, the client cannot verify the correctness of the calculation. Therefore, several verifiable BQC (VBQC) protocols have been proposed 15‐27 . In 2015, Hayashi and Morimae proposed a VBQC protocol by utilizing the stabilizer test verification 20 .…”

Section: Introductionmentioning

confidence: 99%

“…However, the use of trap qubits leads to a reduction in the quantum resources of the client. In addition to these two verification methods mentioned in these two protocols, there are other ways to implement verification such as verification based on repeated runs, 15 post hoc verification, 18,21 and verification based on CHSH rigidity 22‐27 …”

Section: Introductionmentioning

confidence: 99%

A simplified verifiable blind quantum computing protocol with quantum input verification

Quan

Liu³

et al. 2021

Quantum Engineering

View full text Add to dashboard Cite

Blind quantum computing (BQC) enables a client with limited quantum capability to delegate her quantum computation to a remote quantum server and still keeps the client's input, output, and the algorithm private. One important property of BQC is verifiability, which means the client can verify the correctness of the computation or unknown quantum inputs. Recently, Morimae proposed a verifiable blind quantum computing protocol where the client can verify both the correctness of computing and the quantum input. However, the client needs much quantum memory and takes a lot of qubits to get the true result. We reduce the size of quantum memory and the number of qubits used in Morimae's protocol. Besides, we extend the resource state in Morimae's protocol from graph state to hypergraph state. For certain hypergraph states as resources states, such as Union Jack State, the client only needs Pauli measurements in the computation stage but he needs non‐Clifford basis measurements if graph states are considered as resources states.

show abstract

Parallel self‐testing for device‐independent verifiable blind quantum computation

Cited by 8 publications

References 45 publications

Verifiable Multiparty Delegated Quantum Computation

Verifiable Multiparty Delegated Quantum Computation

Logic W‐state concentration with parity check

A simplified verifiable blind quantum computing protocol with quantum input verification

Contact Info

Product

Resources

About