Multi-server blind quantum computation over collective-noise channels
DOI10.1007/S11128-018-1810-4zbMATH Open1386.81052OpenAlexW2787575812MaRDI QIDQ1746905FDOQ1746905
Publication date: 26 April 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-018-1810-4
Recommendations
- Multiple-server flexible blind quantum computation in networks
- Single-server blind quantum computation with quantum circuit model
- Blind quantum computation with hybrid model
- Multi-server blind quantum computation protocol with limited classical communication among servers
- A hybrid universal blind quantum computation
logical Bell statesblind quantum computationcollective-rotation noisecollective-dephasing noisemulti-server BQC
Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Open systems, reduced dynamics, master equations, decoherence (81S22) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Robust anti-collective noise quantum secure direct dialogue using logical Bell states
- Quantum Computation and Quantum Information
- FAULT TOLERANT QUANTUM KEY DISTRIBUTION BASED ON QUANTUM DENSE CODING WITH COLLECTIVE NOISE
- Universal Blind Quantum Computation
- Mixed-state entanglement and quantum error correction
- A possible strategy to defeat decoherence in quantum computation: the role of symmetries, dynamical algebras, and all that.
- Title not available (Why is that?)
- Robust quantum dialogue based on the entanglement swapping between any two logical Bell states and the shared auxiliary logical Bell state
- Quantum secure direct dialogue over collective noise channels based on logical Bell states
- Fault-Tolerant Quantum Dialogue Without Information Leakage Based on Entanglement Swapping between Two Logical Bell States*
- Fault-tolerant authenticated quantum dialogue using logical Bell states
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits
Cited In (4)
This page was built for publication: Multi-server blind quantum computation over collective-noise channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1746905)