A general framework for the composition of quantum homomorphic
encryption \& quantum error correction
- URL: http://arxiv.org/abs/2204.10471v1
- Date: Fri, 22 Apr 2022 02:47:07 GMT
- Title: A general framework for the composition of quantum homomorphic
encryption \& quantum error correction
- Authors: Yingkai Ouyang and Peter P. Rohde
- Abstract summary: Two essential primitives for universal, cloud-based quantum computation are quantum homomorphic encryption with information-theoretic security and quantum error correction.
We apply our framework to both discrete- and continuous-variable models for quantum computation.
- Score: 6.85316573653194
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Two essential primitives for universal, cloud-based quantum computation with
security based on the laws of quantum mechanics, are quantum homomorphic
encryption with information-theoretic security and quantum error correction.
The former enables information-theoretic security of outsourced quantum
computation, while the latter allows reliable and scalable quantum computations
in the presence of errors. Previously these ingredients have been considered in
isolation from one another. By establishing group-theoretic requirements that
these two ingredients must satisfy, we provide a general framework for
composing them. Namely, a quantum homomorphic encryption scheme enhanced with
quantum error correction can directly inherit its properties from its
constituent quantum homomorphic encryption and quantum error correction
schemes. We apply our framework to both discrete- and continuous-variable
models for quantum computation, such as Pauli-key and permutation-key
encryptions in the qubit model, and displacement-key encryptions in a
continuous-variable model based on Gottesman-Kitaev-Preskill codes.
Related papers
- Quantum Indistinguishable Obfuscation via Quantum Circuit Equivalence [6.769315201275599]
Quantum computing solutions are increasingly deployed in commercial environments through delegated computing.
One of the most critical issues is to guarantee the confidentiality and proprietary of quantum implementations.
Since the proposal of general-purpose indistinguishability obfuscation (iO) and functional encryption schemes, iO has emerged as a seemingly versatile cryptography primitive.
arXiv Detail & Related papers (2024-11-19T07:37:24Z) - The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
The anticipated applications of quantum computers span across science and industry.
We present a survey of several potential application areas of quantum algorithms.
We outline the challenges and opportunities in each area in an "end-to-end" fashion.
arXiv Detail & Related papers (2023-10-04T17:53:55Z) - Deploying hybrid quantum-secured infrastructure for applications: When
quantum and post-quantum can work together [0.8702432681310401]
Quantum key distribution is secure against unforeseen technological developments.
Post-quantum cryptography is believed to be secure even against attacks with both classical and quantum computing technologies.
Various directions in the further development of the full-stack quantum-secured infrastructure are also indicated.
arXiv Detail & Related papers (2023-04-10T13:44:21Z) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - Revocable Cryptography from Learning with Errors [61.470151825577034]
We build on the no-cloning principle of quantum mechanics and design cryptographic schemes with key-revocation capabilities.
We consider schemes where secret keys are represented as quantum states with the guarantee that, once the secret key is successfully revoked from a user, they no longer have the ability to perform the same functionality as before.
arXiv Detail & Related papers (2023-02-28T18:58:11Z) - Unclonability and Quantum Cryptanalysis: From Foundations to
Applications [0.0]
Unclonability is a fundamental concept in quantum theory and one of the main non-classical properties of quantum information.
We introduce new notions of unclonability in the quantum world, namely quantum physical unclonability.
We discuss several applications of this new type of unclonability as a cryptographic resource for designing provably secure quantum protocols.
arXiv Detail & Related papers (2022-10-31T17:57:09Z) - Quantum Computation Using Action Variables [4.087043981909747]
We argue quantum computation using action variables as fault-tolerant quantum computation, whose fault-tolerance is guaranteed by the quantum KAM theorem.
Besides, we view the Birkhoff norm form as a mathematical framework of the extended harmonic oscillator quantum computation.
arXiv Detail & Related papers (2021-09-24T12:04:27Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Universal quantum computation and quantum error correction with
ultracold atomic mixtures [47.187609203210705]
We propose a mixture of two ultracold atomic species as a platform for universal quantum computation with long-range entangling gates.
One atomic species realizes localized collective spins of tunable length, which form the fundamental unit of information.
We discuss a finite-dimensional version of the Gottesman-Kitaev-Preskill code to protect quantum information encoded in the collective spins.
arXiv Detail & Related papers (2020-10-29T20:17:14Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.