Improved Resource State for Verifiable Blind Quantum Computation

Xu, Qingshan; Tan, Xiaoqing; Huang, Rui

doi:10.3390/e22090996

Cited by 10 publications

(11 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first verification protocol via trapification was introduced in [2]. It was further optimised into the Verifiable Blind Quantum Computation Protocol (or VBQC) of [16,17], achieving a linear overhead.…”

Section: Preliminariesmentioning

confidence: 99%

Verifying BQP Computations on Noisy Devices with Minimal Overhead

Leichtle¹,

Music²,

Kashefi³

et al. 2021

Preprint

View full text Add to dashboard Cite

With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms, and the integrity of their computations. While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from oversensitivity: When running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. We introduce the first blind and verifiable protocol for delegating BQP computations to a powerful server with repetition as the only overhead. It is composable and statistically secure with exponentially-low bounds and can tolerate a constant amount of global noise.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Verifying BQP Computations on Noisy Devices with Minimal Overhead

Leichtle¹,

Music²,

Kashefi³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…The first protocol achieving verification through trappification was introduced in [5] and achieved a quadratic overhead in the number of qubits. It was later optimized, such as in the Verifiable Blind Quantum Computation Protocol (or VBQC) of [21] or in [22] to achieve a linear overhead.…”

Section: Verifiability Through Trap Insertionmentioning

confidence: 99%

Securing Quantum Computations in the NISQ Era

Kashefi,

Leichtle,

Music

et al. 2020

Preprint

View full text Add to dashboard Cite

Recent experimental achievements motivate an ever-growing interest from companies starting to feel the limitations of classical computing. Yet, in light of ongoing privacy scandals, the future availability of quantum computing through remotely accessible servers pose peculiar challenges: Clients with quantum-limited capabilities want their data and algorithms to remain hidden, while being able to verify that their computations are performed correctly. Research in blind and verifiable delegation of quantum computing attempts to address this question. However, available techniques suffer not only from high overheads but also from over-sensitivity: When running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. Hence, while malicious quantum computers are rendered harmless by blind and verifiable protocols, inherent noise severely limits their usability.We address this problem with an efficient, robust, blind, verifiable scheme to delegate deterministic quantum computations with classical inputs and outputs. We show that: 1) a malicious Server can cheat at most with an exponentially small success probability; 2) in case of sufficiently small noise, the protocol succeeds with a probability exponentially close to 1; 3) the overhead is barely a polynomial number of repetitions of the initial computation interleaved with test runs requiring the same physical resources in terms of memory and gates; 4) the amount of tolerable noise, measured by the probability of failing a test run, can be as high as 25% for some computations and will be generally bounded by 12.5% when using a planar graph resource state. The key points are that security can be provided without universal computation graphs and that, in our setting, full fault-tolerance is not needed to amplify the confidence level exponentially close to 1.

show abstract

“…Existing studies have explored both the verification of BQC with the quantum measurement capability of the client [8][9][10][11] and the verification of the universal BQC. [12][13][14] In 2005, Childs [15] proposed the first BQC protocol, based on the quantum circuit model. The quantum states in the protocol are encrypted by one-time pads, and the client should qualify for quantum storage and quantum swap gate execution.…”

Section: Introductionmentioning

confidence: 99%

“…In 2017, Kashefi and Wallden [13] improved the above protocol and designed an optimization scheme with fewer quantum resources (KW protocol). In 2020, Xu et al [14] further improved the construction method of the verifiable computation graph state (XTH protocol), which reduces quantum resources and realizes a lower probability of accepting an incorrect computation result. However, its coloring scheme has limitations, and the probability of accepting incorrect computation results remains at a high level.…”

Section: Introductionmentioning

confidence: 99%

Analysis and improvement of verifiable blind quantum computation

Xiao¹,

Zhang²

2022

Chinese Phys. B

View full text Add to dashboard Cite

In blind quantum computation (BQC), a client with weak quantum computation capabilities is allowed to delegate its quantum computation tasks to a server with powerful quantum computation capabilities, and the inputs, algorithms and outputs of the quantum computation are confidential to the server. Verifiability refers to the ability of the client to verify with a certain probability whether the server has executed the protocol correctly and can be realized by introducing trap qubits into the computation graph state to detect server deception. The existing verifiable universal BQC protocols are analyzed and compared in detail. The XTH protocol (proposed by Xu Q S, Tan X Q, Huang R in 2020), a recent improvement protocol of verifiable universal BQC, uses a sandglass-like graph state to further decrease resource expenditure and enhance verification capability. However, the XTH protocol has two shortcomings: limitations in the coloring scheme and a high probability of accepting an incorrect computation result. In this paper, we present an improved version of the XTH protocol, which revises the limitations of the original coloring scheme and further improves the verification ability. The analysis demonstrates that the resource expenditure is the same as for the XTH protocol, while the probability of accepting the wrong computation result is reduced from the original minimum (0.866) d* to (0.819) d*, where d* is the number of repeated executions of the protocol.

show abstract

Improved Resource State for Verifiable Blind Quantum Computation

Cited by 10 publications

References 33 publications

Verifying BQP Computations on Noisy Devices with Minimal Overhead

Verifying BQP Computations on Noisy Devices with Minimal Overhead

Securing Quantum Computations in the NISQ Era

Analysis and improvement of verifiable blind quantum computation

Contact Info

Product

Resources

About