Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes

• URL: http://arxiv.org/abs/2401.08059v3
• Date: Thu, 20 Feb 2025 08:05:00 GMT
• Title: Error correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
• Authors: IlKwon Sohn, Boseon Kim, Kwangil Bae, Wonhyuk Lee,
• Abstract summary: We develop an efficient quantum homomorphic encryption scheme based on quantum error correction codes.<n>By using a longer quantum error correction code, both the security and error-correction capabilities of the scheme are improved.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The integration of quantum error correction codes and homomorphic encryption schemes is essential for achieving fault-tolerant secure cloud quantum computing. However, owing to the significant overheads associated with these schemes, their efficiency is paramount. In this study, we develop an efficient quantum homomorphic encryption scheme based on quantum error correction codes that uses a single encoding process to simultaneously perform encryption and encoding. By using a longer quantum error correction code, both the security and error-correction capabilities of the scheme are improved. Through comprehensive evaluations, we demonstrate that the proposed scheme is more secure than the conventional permutation-key-based QHE scheme when the number of maximally mixed states is not more than twice the length of the quantum error-correction code. The proposed scheme offers a more secure and efficient approach to quantum cloud computing, potentially paving the way for more practical and scalable quantum cryptographic protocols.

Related papers

• Order-of-magnitude extension of qubit lifetimes with a decoherence-free subspace quantum error correction code [0.0]
  We report on a robust quantum memory design using a decoherence-free subspace quantum error correction code. The resulting encoding scheme is characterized for long probe times, and shown to extend the memory time by over an order of magnitude compared to physical qubits.
  arXiv  Detail & Related papers  (2025-03-28T02:58:34Z)
• Quantum Error Correction near the Coding Theoretical Bound [0.0]
  We present quantum error-correcting codes constructed from classical LDPC codes. These codes approach the hashing bound while maintaining linear computational complexity in the number of physical qubits. This result establishes a pathway toward realizing large-scale, fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2024-12-30T18:48:54Z)
• 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)
• On the practicality of quantum sieving algorithms for the shortest vector problem [42.70026220176376]
  lattice-based cryptography is one of the main candidates of post-quantum cryptography. cryptographic security against quantum attackers is based on lattice problems like the shortest vector problem (SVP) Asymptotic quantum speedups for solving SVP are known and rely on Grover's search.
  arXiv  Detail & Related papers  (2024-10-17T16:54:41Z)
• Revocable Encryption, Programs, and More: The Case of Multi-Copy Security [48.53070281993869]
  We show the feasibility of revocable primitives, such as revocable encryption and revocable programs. This suggests that the stronger notion of multi-copy security is within reach in unclonable cryptography.
  arXiv  Detail & Related papers  (2024-10-17T02:37:40Z)
• 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)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• 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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• 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)
• 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)

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.