Improved Gilbert–Varshamov Bound for Entanglement-Assisted Asymmetric Quantum Error Correction by Symplectic Orthogonality

We propose and prove an existential theorem for entanglement-assisted asymmetric quantum error correction. Then, we demonstrate its superiority over the conventional one. For more about this transaction see link below.  https://ieeexplore.ieee.org/document/9076251

Theory of Quantum Computation With Magnetic Clusters

We propose a complete, quantitative quantum computing system that satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where two-state qubits are formed utilizing the two lowest lying states of an anisotropic potential energy. We outline the quantum dynamics required by quantum computing for single-qubit structures, and then define […]

Quantum Computer Architecture Toward Full-Stack Quantum Accelerators

This article presents the definition and implementation of a quantum computer architecture to enable creating a new computational device-a quantum computer as an accelerator. A key question addressed is what such a quantum computer is and how it relates to the classical processor that controls the entire execution process. In this article, we present explicitly […]

Enhancing a Near-Term Quantum Accelerator’s Instruction Set Architecture for Materials Science Applications

Quantum computers with tens to hundreds of noisy qubits are being developed today. To be useful for real-world applications, we believe that these near-term systems cannot simply be scaled-down non-error-corrected versions of future fault-tolerant large-scale quantum computers. These near-term systems require specific architecture and design attributes to realize their full potential. To efficiently execute an […]

Decoding Quantum Error Correction Codes With Local Variation

In this article, we investigate the role of local information in the decoding of the repetition and surface error correction codes for the protection of quantum states. Our key result is an improvement in resource efficiency when local information is taken into account during the decoding process: the code distance associated with a given logical […]

Fault-Tolerant Resource Estimation of Quantum Random-Access Memories

Quantum random-access lookup of a string of classical bits is a necessary ingredient in several important quantum algorithms. In some cases, the cost of such quantum random-access memory (qRAM) is the limiting factor in the implementation of the algorithm. In this article, we study the cost of fault-tolerantly implementing a qRAM. We construct and analyze […]

Reducing the Cost of Implementing the Advanced Encryption Standard as a Quantum Circuit

To quantify security levels in a postquantum scenario, it is common to use the quantum resources needed to attack the Advanced Encryption Standard (AES) as a reference value. Specifically, in the National Institute of Standards and Technology’s ongoing postquantum standardization effort, different security categories are defined that reflect the quantum resources needed to attack AES-128, […]