Error correctable efficient quantum homomorphic encryption using
Calderbank-Shor-Steane codes
- URL: http://arxiv.org/abs/2401.08059v2
- Date: Sat, 27 Jan 2024 07:02:05 GMT
- Title: Error correctable efficient quantum homomorphic encryption using
Calderbank-Shor-Steane codes
- Authors: IlKwon Sohn, Boseon Kim, Kwangil Bae, Wonhyuk Lee
- Abstract summary: This study developed an efficient quantum homomorphic encryption based on quantum error correction codes.
Using a longer quantum error-correcting code simultaneously improved the security and error correction capabilities.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: To achieve fault-tolerant and secure cloud quantum computing, integrating
quantum error correction codes and quantum homomorphic encryption schemes is
essential. However, significant overhead challenges incurred in these schemes
necessitate their efficiency. This study developed an efficient quantum
homomorphic encryption based on quantum error correction codes. The proposed
encryption scheme used a single encoding process to accomplish encryption and
encoding. Using a longer quantum error-correcting code simultaneously improved
the security and error correction capabilities. Based on the permutation key,
the number of combinations exhibited an exponential growth of $n^n$ compared
with the conventional order of $2^n$.
Related papers
- Many-hypercube codes: High-rate quantum error-correcting codes for high-performance fault-tolerant quantum computing [0.0]
We propose high-rate small-size quantum error-detecting codes as a new family of high-rate quantum codes.
Their simple structure allows for a geometrical interpretation using hypercubes corresponding to logical qubits.
We achieve high error thresholds even in a circuit-level noise model.
arXiv Detail & Related papers (2024-03-24T07:46:26Z) - Systematic Design and Optimization of Quantum Circuits for Stabilizer
Codes [11.637855523244838]
Keeping qubits error free is one of the most important steps towards reliable quantum computing.
Different stabilizer codes for quantum error correction have been proposed in past decades.
We propose a formal algorithm for systematic construction of encoding circuits for general stabilizer codes.
arXiv Detail & Related papers (2023-09-21T03:21:47Z) - 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) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space.
We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit.
We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
arXiv Detail & Related papers (2023-01-24T14:17:07Z) - A general framework for the composition of quantum homomorphic
encryption \& quantum error correction [6.85316573653194]
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.
arXiv Detail & Related papers (2022-04-22T02:47:07Z) - A practical quantum encryption protocol with varying encryption
configurations [0.0]
We propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks oftext ciphers based on quantum states.
The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks.
arXiv Detail & Related papers (2021-01-22T20:09:03Z) - Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes.
We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code.
We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
arXiv Detail & Related papers (2020-12-07T23:22:40Z) - 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) - A quantum encryption design featuring confusion, diffusion, and mode of
operation [0.0]
We propose a non-OTP quantum encryption scheme utilizing a quantum state creation process to encrypt messages.
As essentially a non-OTP quantum block cipher the method stands out against existing methods with the following features.
arXiv Detail & Related papers (2020-10-06T22:23:30Z) - Quantum copy-protection of compute-and-compare programs in the quantum random oracle model [48.94443749859216]
We introduce a quantum copy-protection scheme for a class of evasive functions known as " compute-and-compare programs"
We prove that our scheme achieves non-trivial security against fully malicious adversaries in the quantum random oracle model (QROM)
As a complementary result, we show that the same scheme fulfils a weaker notion of software protection, called "secure software leasing"
arXiv Detail & Related papers (2020-09-29T08:41:53Z)
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.