Abstract: To address the challenge posed by noise in real quantum devices, quantum error mitigation techniques play a crucial role. These techniques are resource-efficient, making them suitable for implementation in noisy intermediate-scale quantum devices, unlike the more resource-intensive quantum error correction codes. A notable example of such a technique is Clifford Data Regression, which employs […]
Abstract: Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codes C, D satisfying C⊥⊂C⊂D through the Calderbank-Shor-Steane (CSS) code construction. In this work, we establish connections between quantum synchronizable codes, subsystem codes, and […]
Abstract: Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically operate on qubits—quantum information elements that can occupy superpositions of the basis |0⟩ and |1⟩ states—recent advances have demonstrated the practical implementation of higher dimensional […]
Abstract: Currently, the development of quantum computers is active; however, large-scale machines remain limited and noisy. Furthermore, such quantum computers do not allow direct access to state vectors, posing challenges for quantum algorithm development. Quantum circuit simulators on classical computers offer a solution, with decision diagram (DD)-based simulators being particularly memory-efficient for representing quantum states. […]
Abstract: In this article, we consider second-generation (2G) quantum repeaters (QRs) for creating long-distance entanglement in quantum networks. Combining a distance-dependent depolarizing error model with the nonlocal Bell state purification procedure required by 2G QRs leads to an error model consisting of correlated and biased errors. To correct correlated errors, nonsymmetric Calderbank–Steane–Shor (CSS) codes with […]
Abstract: We consider exact quantum circuit synthesis, quantum gate efficiency, and the spectral gap conjecture from the perspective of computable analysis. Circuit synthesis, in both its exact and its approximate variant, is fundamental to the circuit model of quantum computing. As an engineering problem, however, the practical and theoretical aspects of quantum circuit synthesis are […]
Abstract: In quantum state discrimination, the design of measurement operators and probe states is typically formulated under the assumption that the set of possible states is perfectly known, but this may yield designs that are sensitive to deviations in the realized set of states. For example, the channel through which a transmitted state is sent […]
Abstract: The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables. Its solution is a fundamental step in the electronic design automation (EDA) tool chains commonly used for digital circuit design. In fact, the library-mapping step of an […]
Abstract: Analog circuits have emerged as a valuable quantum emulation and simulation platform. Specifically, they have been experimentally shown to excel in emulating coherent state vector dynamics and motifs of quantum circuits, such as the quantum Fourier transform, tensor product superpositions, two-level systems such as Josephson junctions, and nuclear magnetic resonance state dynamics, all on […]
Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. For more about this […]