We provide a procedure to construct entanglement-assisted Calderbank-Shor-Steane (CSS) codes over qudits from the parity check matrices of two classical codes over F q , where q = p k , p is prime, and k is a positive integer. The construction procedure involves the proposed Euclidean Gram-Schmidt orthogonalization algorithm, followed by a procedure to extend the quantum operators […]
Due to several physical limitations in the realization of quantum hardware, today’s quantum computers are qualified as noisy intermediate-scale quantum (NISQ) hardware. NISQ hardware is characterized by a small number of qubits (50 to a few hundred) and noisy operations. Moreover, current realizations of superconducting quantum chips do not have the ideal all-to-all connectivity between […]
Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators to be translated into physical operators acting on physical quantum states. In this article, we propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the […]
In this article, we present the experimental characterization of crosstalk in quantum information processor using idle tomography and simultaneous randomized benchmarking. We quantify both “quantum” and “classical” crosstalk in the device and analyze quantum circuits considering crosstalk. We show that simulation considering only gate-error deviates from experimental results up to 27%, whereas simulation considering both […]
This article addresses the formulation for implementing a single source, single-destination shortest path algorithm on a quantum annealing computer. Three distinct approaches are presented. In all the three cases, the shortest path problem is formulated as a quadratic unconstrained binary optimization problem amenable to quantum annealing. The first implementation builds on existing quantum annealing solutions […]
Quantum key distribution (QKD) provides a potent solution to securely distribute keys for two parties. However, QKD itself is vulnerable to denial of service (DoS) attacks. A flexible and resilient QKD-enabled networked microgrids (NMs) architecture is needed but does not yet exist. In this article, we present a programmable quantum NMs (PQNMs) architecture. It is […]
A semiquantum key distribution (SQKD) protocol allows two users, one of whom is restricted in their quantum capabilities to being nearly classical, to establish a shared secret key, secure against an all-powerful adversary. The study of such protocols helps to answer the fundamental question of “how quantum” must a protocol be to gain an advantage […]
Because noisy intermediate-scale quantum (NISQ) machines accumulate errors quickly, we need new approaches to designing NISQ-aware algorithms and assessing their performance. Algorithms with characteristics that appear less desirable under ideal circumstances, such as lower success probability, may in fact outperform their ideal counterparts on existing hardware. We propose an adaptation of Grover’s algorithm, subdividing the […]
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
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 […]