Implementing Quantum Secret Sharing on Current Hardware

• URL: http://arxiv.org/abs/2410.11640v1
• Date: Tue, 15 Oct 2024 14:30:53 GMT
• Title: Implementing Quantum Secret Sharing on Current Hardware
• Authors: Jay Graves, Mike Nelson, Eric Chitambar,
• Abstract summary: Quantum secret sharing is a cryptographic scheme that enables a secure storage and reconstruction of quantum information. We provide a pedagogical description of encoding and decoding circuits for different secret sharing codes. We test their performance on IBM's 127-qubit Brisbane system.
• Score: 2.85386288555414
• License:
• Abstract: Quantum secret sharing is a cryptographic scheme that enables a secure storage and reconstruction of quantum information. While the theory of secret sharing is mature in its development, relatively few studies have explored the performance of quantum secret sharing on actual devices. In this work, we provide a pedagogical description of encoding and decoding circuits for different secret sharing codes, and we test their performance on IBM's 127-qubit Brisbane system. We evaluate the quality of implementation by performing a SWAP test between the decoded state and the ideal one, as well as by estimating how well the code preserves entanglement with a reference system. Results indicate that a ((3,5)) threshold secret sharing scheme performs slightly better overall than a ((5,7)) scheme based on the SWAP test, but is outperformed by the Steane Code scheme in regards to the entanglement fidelity. We also investigate one implementation of a ((2,3)) qutrit scheme and find that it performs the worst of all, which is expected due to the additional number of multi-qubit gate operations needed to encode and decode qutrits.

Related papers

• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• 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)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Realizing a class of stabilizer quantum error correction codes using a single ancilla and circular connectivity [0.0]
  We show that a class of "neighboring-blocks" stabilizer quantum error correction codes can be implemented in a resource-efficient manner using a single ancilla and circular near-neighbor qubit connectivity. We propose an implementation for syndrome-measurement circuits for codes from the class and illustrate its workings for cases of three-, five-, and nine-qubits stabilizer code schemes.
  arXiv  Detail & Related papers  (2022-07-27T08:25:38Z)
• Quantum Proofs of Deletion for Learning with Errors [91.3755431537592]
  We construct the first fully homomorphic encryption scheme with certified deletion. Our main technical ingredient is an interactive protocol by which a quantum prover can convince a classical verifier that a sample from the Learning with Errors distribution in the form of a quantum state was deleted.
  arXiv  Detail & Related papers  (2022-03-03T10:07:32Z)
• A Four-Party Quantum Secret-Sharing Scheme based on Grover's Search Algorithm [3.706222947143855]
  The work presents an amalgam of quantum search algorithm (QSA) and quantum secret sharing (QSS) The proposed QSS scheme utilizes Grover's three-particle quantum state. The security analysis shows the scheme is stringent against malicious participants or eavesdroppers.
  arXiv  Detail & Related papers  (2021-11-17T06:48:23Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Sharing classical secrets with continuous-variable entanglement: Composable security and network coding advantage [0.913755431537592]
  We show that multi-partite entangled resources achieve a genuine advantage over point-to-point protocols for quantum communication. This is the first concrete compelling examples of multi-partite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication.
  arXiv  Detail & Related papers  (2021-04-21T17:37:28Z)
• Quantum Fully Homomorphic Encryption by Integrating Pauli One-time Pad with Quaternions [4.182969308816531]
  Quantum fully homomorphic encryption (QFHE) allows to evaluate quantum circuits on encrypted data. We present a novel QFHE scheme, which extends Pauli one-time pad encryption by relying on the quaternion of SU(2).
  arXiv  Detail & Related papers  (2020-12-08T04:54:02Z)
• 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)
• A novel three party Quantum secret sharing scheme based on Bell state sequential measurements with application in quantum image sharing [4.378411442784295]
  We present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the parties do not divulge in their valid measurement outcomes.
  arXiv  Detail & Related papers  (2020-08-14T07:50:35Z)

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.