Computationally-secure and composable remote state preparation

Gheorghiu, Alexandru; Vidick, Thomas

doi:10.48550/arxiv.1904.06320

Cited by 11 publications

(21 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Building on [BCM + 18] and using techniques from [Mah18], Gheorghiu and Vidick construct a protocol for verifiable remote state preparation (RSP) [GV19]. They consider a set of single-qubit pure states {|ψ 1 , .…”

mentioning

confidence: 99%

“…[CCKW19], who call this notion "blind self-testing". They analyze a different protocol under a restricted adversarial model and conjecture that their protocol yields similar guarantees as [GV19] for single-qubit states and tensor products of single-qubit states.…”

mentioning

confidence: 99%

mentioning

confidence: 99%

“…The self-testing protocol presented here builds on [GV19]. Whereas the RSP protocol in [GV19] prepares a single-qubit state, our self-testing protocol certifies that the qubits of an entangled 2-qubit state have been measured individually. Moving from a single-qubit state to an entangled two-qubit state means that the verifier has to enforce a tensor product structure on the prover's space, which is one of the main difficulties in our soundness proof (Section 4).…”

mentioning

confidence: 99%

“…On a technical level, it requires the certification of compatibility relations between different measurements meant to act on different qubits. Additionally, having two qubits instead of one prevents us from using Jordan's lemma, a standard tool in self-testing also used in [GV19], to characterise the prover's measurements; in Section 4.7, we show how to characterise the prover's measurements using a different method starting with a partial characterisation of the prover's measurements, using that to partially characterise the prover's states, which in turn is used for a stronger partial characterisation of the measurements, etc., until we reach the full statement that shows that the prover makes single-qubit measurements on a Bell pair.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Self-testing of a single quantum device under computational assumptions

Metger,

Vidick

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Self-testing is a method to characterise an arbitrary quantum system based only on its classical inputoutput correlations. This usually requires the assumption that the system's state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed singlequbit measurements on it, up to a change of basis applied to both the device's state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement inside a single quantum device. We achieve this using techniques introduced by Brakerski et al. (2018) andMahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.

show abstract

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Self-testing of a single quantum device under computational assumptions

Metger,

Vidick

2020

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources

Coladangelo

Grilo

Jeffery

et al. 2019

Advances in Cryptology – EUROCRYPT 2019

Self Cite

View full text Add to dashboard Cite

The problem of reliably certifying the outcome of a computation performed by a quantum device is rapidly gaining relevance. We present two protocols for a classical verifier to verifiably delegate a quantum computation to two non-communicating but entangled quantum provers. Our protocols have near-optimal complexity in terms of the total resources employed by the verifier and the honest provers, with the total number of operations of each party, including the number of entangled pairs of qubits required of the honest provers, scaling as O(g log g) for delegating a circuit of size g. This is in contrast to previous protocols, whose overhead in terms of resources employed, while polynomial, is far beyond what is feasible in practice. Our first protocol requires a number of rounds that is linear in the depth of the circuit being delegated, and is blind, meaning neither prover can learn the circuit or its input. The second protocol is not blind, but requires only a constant number of rounds of interaction.Our main technical innovation is an efficient rigidity theorem that allows a verifier to test that two entangled provers perform measurements specified by an arbitrary m-qubit tensor product of singlequbit Clifford observables on their respective halves of m shared EPR pairs, with a robustness that is independent of m. Our two-prover classical-verifier delegation protocols are obtained by combining this rigidity theorem with a single-prover quantum-verifier protocol for the verifiable delegation of a quantum computation, introduced by Broadbent (Theory of Computing, 2018).

show abstract

Towards experimental classical verification of quantum computation

Stricker,

Carrasco,

Ringbauer

et al. 2024

Quantum Sci. Technol.

View full text Add to dashboard Cite

With today's quantum processors venturing into regimes beyond the capabilities of classical devices, we face the challenge to verify that these devices perform as intended, even when we cannot check their results on classical computers. In a recent breakthrough in computer science, a protocol was developed that allows the verification of the output of a computation performed by an untrusted quantum device based only on classical resources. Here, we follow these ideas, and demonstrate in a first, proof-of-principle experiment the verification of the output of a quantum computation using only classical means on a small trapped-ion quantum processor.We contrast this to verification protocols, which require trust and detailed hardware knowledge, as in gate-level benchmarking, or additional quantum resources in case we do not have access to or trust in the device to be tested. While our experimental demonstration uses a simplified version of Mahadev's protocol we demonstrate the necessary steps for verifying fully untrusted devices.A scaled-up version of our protocol will allow for classical verification, requiring no hardware access or detailed knowledge of the tested device. Its security relies on post--quantum secure trapdoor functions within an interactive proof. The conceptually straightforward, but technologically challenging scaled-up version of the interactive proofs, considered here, can be used for a variety of additional tasks such as verifying quantum advantage, generating and certifying quantum randomness, or composable remote state preparation.

show abstract

Computationally-secure and composable remote state preparation

Cited by 11 publications

References 0 publications

Self-testing of a single quantum device under computational assumptions

Self-testing of a single quantum device under computational assumptions

Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources

Towards experimental classical verification of quantum computation

Contact Info

Product

Resources

About