Compare Papers
Paper 1
Quantum Operating System Support for Quantum Trusted Execution Environments
Theodoros Trochatos, Jakub Szefer
- Year
- 2024
- Journal
- arXiv preprint
- DOI
- arXiv:2410.08486
- arXiv
- 2410.08486
With the growing reliance on cloud-based quantum computing, ensuring the confidentiality and integrity of quantum computations is paramount. Quantum Trusted Execution Environments (QTEEs) have been proposed to protect users' quantum circuits when they are submitted to remote cloud-based quantum computers. However, deployment of QTEEs necessitates a Quantum Operating Systems (QOS) that can support QTEEs hardware and operation. This work introduces the first architecture for a QOS to support and enable essential steps required for secure quantum task execution on cloud platforms.
Open paperPaper 2
Entanglement-assisted Quantum Error Correcting Code Saturating The Classical Singleton Bound
Soham Ghosh, Evagoras Stylianou, Holger Boche
- Year
- 2024
- Journal
- arXiv preprint
- DOI
- arXiv:2410.04130
- arXiv
- 2410.04130
We introduce a construction for entanglement-assisted quantum error-correcting codes (EAQECCs) that saturates the classical Singleton bound with less shared entanglement than any known method for code rates below $ \frac{k}{n} = \frac{1}{3} $. For higher rates, our EAQECC also meets the Singleton bound, although with increased entanglement requirements. Additionally, we demonstrate that any classical $[n,k,d]_q$ code can be transformed into an EAQECC with parameters $[[n,k,d;2k]]_q$ using $2k$ pre-shared maximally entangled pairs. The complexity of our encoding protocol for $k$-qudits with $q$ levels is $\mathcal{O}(k \log_{\frac{q}{q-1}}(k))$, excluding the complexity of encoding and decoding the classical MDS code. While this complexity remains linear in $k$ for systems of reasonable size, it increases significantly for larger-levelled systems, highlighting the need for further research into complexity reduction.
Open paper