Universal Blind Quantum Computation
From MaRDI portal
Abstract: We present a protocol which allows a client to have a server carry out a quantum computation for her such that the client's inputs, outputs and computation remain perfectly private, and where she does not require any quantum computational power or memory. The client only needs to be able to prepare single qubits randomly chosen from a finite set and send them to the server, who has the balance of the required quantum computational resources. Our protocol is interactive: after the initial preparation of quantum states, the client and server use two-way classical communication which enables the client to drive the computation, giving single-qubit measurement instructions to the server, depending on previous measurement outcomes. Our protocol works for inputs and outputs that are either classical or quantum. We give an authentication protocol that allows the client to detect an interfering server; our scheme can also be made fault-tolerant. We also generalize our result to the setting of a purely classical client who communicates classically with two non-communicating entangled servers, in order to perform a blind quantum computation. By incorporating the authentication protocol, we show that any problem in BQP has an entangled two-prover interactive proof with a purely classical verifier. Our protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side. The novelty of our approach is in using the unique features of measurement-based quantum computing which allows us to clearly distinguish between the quantum and classical aspects of a quantum computation.
Cited in
(93)- Universal blind quantum computation for hybrid system
- Blind quantum signature with blind quantum computation
- Quantum security computation on shared secrets
- Multi-server blind quantum computation over collective-noise channels
- Single-server blind quantum computation with quantum circuit model
- Controlled mutual quantum entity authentication with an untrusted third party
- Finite-data-size study on practical universal blind quantum computation
- Authenticated semiquantum dialogue with secure delegated quantum computation over a collective noise channel
- Blind quantum machine learning based on quantum circuit model
- Quantum verifiable protocol for secure modulo zero-sum randomness
- Measurement-based universal blind quantum computation with minor resources
- Multi-server blind quantum computation protocol with limited classical communication among servers
- The brickwork state with fewer qubits in blind quantum computation
- Multiparty blind quantum computation protocol with deterministic mutual identity authentication
- Effective agent quantum private data query against malicious joint attack with blind quantum computing
- Transferable quantum cheque scheme based on quantum public-key cryptography
- Analysis of a tripartite entanglement distribution switch
- Constant-round blind classical verification of quantum sampling
- Delegating quantum computation in the quantum random oracle model
- Secure two-party computation based on blind quantum computation
- A hybrid universal blind quantum computation
- Quantum homomorphic encryption scheme with flexible number of evaluator based on \((k, n)\)-threshold quantum state sharing
- Secure multi-party quantum computation based on blind quantum computation
- Secure multi-party quantum private information query
- Verification of quantum computation: an overview of existing approaches
- Verification of quantum computation and the price of trust
- Quantum entanglement establishment between two strangers
- Arbitrable blind quantum computation
- Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security
- Impact of the malicious input data modification on the efficiency of quantum spatial search
- Fault-tolerant quantum error correction code preparation in UBQC
- Improved multiparty quantum private comparison based on quantum homomorphic encryption
- Entangled states as robust and re-usable carriers of information
- Fault-tolerant blind quantum computing using GHZ states over depolarization channel
- Equivalence of single-server and multiple-server blind quantum computation protocols
- Security limitations of classical-client delegated quantum computing
- Public verifiable measurement-only blind quantum computation based on entanglement witnesses
- Rate-1 quantum fully homomorphic encryption
- Computational Security of Quantum Encryption
- Optimised resource construction for verifiable quantum computation
- Information theoretically secure hypothesis test for temporally unstructured quantum computation (extended abstract)
- Adiabatic graph-state quantum computation
- Classical homomorphic encryption for quantum circuits
- Measurement-Based and Universal Blind Quantum Computation
- How to Verify a Quantum Computation
- Symmetric quantum fully homomorphic encryption with perfect security
- Quantum fully homomorphic encryption scheme based on universal quantum circuit
- Maximally nonlocal subspaces
- scientific article; zbMATH DE number 7561499 (Why is no real title available?)
- Classical verification of quantum computations
- Entanglement distribution between quantum repeater nodes with an absorptive type memory
- An introduction to quantum computing, without the physics
- Robustness and device independence of verifiable blind quantum computing
- Photonic four-qubit entangled decoherence-free states assisted by cavity-QED system
- Verifying quantum computations at scale: a cryptographic leash on quantum devices
- Unitary circuit synthesis for tomography of generalized coherent states
- Efficient arbitrated quantum signature scheme without entangled states
- Entanglement, flow and classical simulatability in measurement based quantum computation
- Self-testing protocols based on the chained Bell inequalities
- Optimal quantum networks and one-shot entropies
- Computation in a general physical setting
- Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
- Commuting quantum circuits and complexity of Ising partition functions
- Classical Homomorphic Encryption for Quantum Circuits
- The quantum internet: a hardware review
- A prototype of quantum von Neumann architecture
- Secure delegated quantum algorithms for solving Mahalanobis distance
- Categorical composable cryptography: extended version
- Categorical composable cryptography
- Universal resources for quantum computing
- Obfuscation of pseudo-deterministic quantum circuits
- Quantum one-time pad-based quantum homomorphic encryption schemes for circuits of the non-Clifford gates
- Multi-agent blind quantum computation without universal cluster states
- Complex quantum networks: a topical review
- Half-blind quantum computation with operation teleportation
- Secure two-party computation via measurement-based quantum computing
- Leveraging Grover's algorithm for quantum searchable encryption in cloud infrastructure and its application in AES resource estimation
- Emerging applications of measurement-based quantum computing
- An algebraic formulation of Pauli flow, leading to faster flow-finding algorithms
- Multi-party verifiable blind quantum computation protocol with mutual authentication
- Compiled nonlocal games from any trapdoor claw-free function
- Classical verification of quantum learning
- Quantum federated learning through ancilla-driven quantum computation
- Quantum key distribution in multiparty computation for data sorting by entanglement
- Partial blind quantum computation: a framework for selective circuit protection
- Pauli flow on open graphs with unknown measurement labels
- Universal blind quantum computing assisted by quantum teleportation
- Blind quantum computation with fewer quantum and delegated cost of client
- Rewindable quantum computation and its equivalence to cloning and adaptive postselection
- Arbitrated quantum signature with Hamiltonian algorithm based on blind quantum computation
- Application of blind quantum computation to two-party quantum computation
- Universal blind quantum computation with recursive rotation gates
- Quantum cryptography beyond quantum key distribution
This page was built for publication: Universal Blind Quantum Computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171217)
