scientific article

From MaRDI portal

Revision as of 20:18, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2969059

Jump to:navigation, search

DOI10.4230/LIPIcs.TQC.2014.176zbMath1359.68089arXiv1403.1438MaRDI QIDQ2969059

Elham Kashefi, Animesh Datta, Theodoros Kapourniotis

Publication date: 13 March 2017

Full work available at URL: https://arxiv.org/abs/1403.1438

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

verification delegated computing measurement-based model

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (7)

Verification of quantum computation and the price of trust ⋮ Benchmarking quantum processors with a single qubit ⋮ Rigidity of quantum steering and one-sided device-independent verifiable quantum computation ⋮ Optimised resource construction for verifiable quantum computation ⋮ Robustness and device independence of verifiable blind quantum computing ⋮ Quantum bootstrapping via compressed quantum Hamiltonian learning ⋮ Verification of quantum computation: an overview of existing approaches

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2969059&oldid=15967233"