Self-guaranteed measurement-based quantum computation
arXiv:1603.02195 · doi:10.1103/PhysRevA.97.052308
Abstract
In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling effects, unexpected noise, or unaccounted correlations between several subsystems. If we do not trust the measurement basis nor the prepared entangled state, we do need to be worried about such uncertainties. To this end, we proposes a "self-guaranteed" protocol for verification of quantum computation under the scheme of measurement-based quantum computation where no prior-trusted devices (measurement basis nor entangled state) are needed. The approach we present enables the implementation of verifiable quantum computation using the measurement-based model in the context of a particular instance of delegated quantum computation where the server prepares the initial computational resource and sends it to the client who drives the computation by single-qubit measurements. Applying self-testing procedures we are able to verify the initial resource as well as the operation of the quantum devices, and hence the computation itself. The overhead of our protocol scales as the size of the initial resource state to the power of 4 times the natural logarithm of the initial state's size.
References in corpus (27)
- Simple Proof of Security of the BB84 Quantum Key Distribution Protocol
- Persistent entanglement in arrays of interacting particles
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Measurement-based quantum computation with cluster states
- Measurement-based quantum computation
- High-fidelity preparation, gates, memory and readout of a trapped-ion quantum bit
- Building logical qubits in a superconducting quantum computing system
- Unconditionally verifiable blind computation
- Robust Self Testing of the Singlet
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Experimental verification of quantum computations
- Experimental Verification of Multipartite Entanglement in Quantum Networks
- Reliable quantum certification for photonic quantum technologies
- Robustness and device independence of verifiable blind quantum computing
- Concise and Tight Security Analysis of the Bennett-Brassard 1984 Protocol with Finite Key Lengths
- Post hoc verification with a single prover
- Post hoc verification of quantum computation
- Interactive proofs for BQP via self-tested graph states
- Demonstration of measurement-only blind quantum computing
- Practical Evaluation of Security for Quantum Key Distribution
- Direct certification of a class of quantum simulations
- Verifiable fault-tolerance in measurement-based quantum computation
- Device-Independent Verifiable Blind Quantum Computation
- Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
- Efficient classical verification of quantum computations
- Universality of quantum computation with cluster states and (X,Y)-plane measurements
Cited by in corpus (37)
- Self-testing of quantum systems: a review
- Efficient Verification of Pure Quantum States in the Adversarial Scenario
- A Quantum Internet Architecture
- QuISP: a Quantum Internet Simulation Package
- Quantum homomorphic encryption from quantum codes
- General framework for verifying pure quantum states in the adversarial scenario
- Efficient Verification of Hypergraph States
- Statistical Methods for Quantum State Verification and Fidelity Estimation
- How to Verify a Quantum Computation
- Resource-efficient verification of quantum computing using Serfling's bound
- Attacking the Quantum Internet
- Modeling of Measurement-based Quantum Network Coding on IBM Q Experience Devices
- Verifying commuting quantum computations via fidelity estimation of weighted graph states
- Robust and efficient verification of graph states in blind measurement-based quantum computation
- Quantum verification and estimation with few copies
- Reducing resources for verification of quantum computations
- Secure uniform random number extraction via incoherent strategies
- An elegant proof of self-testing for multipartite Bell inequalities
- Graph-Theoretic Framework for Self-Testing in Bell Scenarios
- Verification of graph states in an untrusted network
- Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
- Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
- Client-friendly continuous-variable blind and verifiable quantum computing
- Verifiable Quantum Secure Modulo Summation
- Efficient Verification of Ground States of Frustration-Free Hamiltonians
- Measurement-based universal blind quantum computation with minor resources
- Role of Hypothesis Testing in Quantum Information
- Efficient classical verification of quantum computations
- Public verifiable measurement-only blind quantum computation based on entanglement witnesses
- Boosting end-to-end entanglement fidelity in quantum repeater networks via hybridized strategies
- Parallel remote state preparation for fully device-independent verifiable blind quantum computation
- Experimental Verification of Entangled States in the Adversarial Scenario
- Optimal Verification of the Bell State and Greenberger-Horne-Zeilinger States in Untrusted Quantum Networks
- Unifying communication paradigms in measurement-based delegated quantum computing
- Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
- Phase Transitions and Noise Robustness of Quantum Graph States
- Certification of multi-qubit quantum systems with temporal inequalities