Related papers: Error correction of parity-encoding-based annealin…
In order to treat all-to-all connected quadratic binary optimization problems (QUBO) with hardware quantum annealers, an embedding of the original problem is required due to the sparsity of the hardware's topology. Embedding fully-connected…
Dual-Encoders is a promising mechanism for answer retrieval in question answering (QA) systems. Currently most conventional Dual-Encoders learn the semantic representations of questions and answers merely through matching score. Researchers…
We consider two different ways to encode quantum information, by parallel or anti-parallel pairs of spins. We find that there is more information in the anti-parallel ones. This purely quantum mechanical effect is due to entanglement, not…
In this dissertation, I present a general method for studying quantum error correction codes (QECCs). This method not only provides us an intuitive way of understanding QECCs, but also leads to several extensions of standard QECCs,…
Quantum error correcting codes enable the information contained in a quantum state to be protected from decoherence due to external perturbations. Applied to NMR, quantum coding does not alter normal relaxation, but rather converts the…
This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory. Explicit constructions are given for entanglement-assisted quantum…
Quantum error correction protects logical quantum information against environmental decoherence by encoding logical qubits into entangled states of physical qubits. One of the most important near-term challenges in building a scalable…
Joint measurements of two-Pauli observables are a powerful tool for both the control and protection of quantum information. By following a simple recipe for measurement choices, single- and two- qubit rotations using two-Pauli parity and…
Quantum annealing is a promising technique which leverages quantum mechanics to solve hard optimization problems. Considerable progress has been made in the development of a physical quantum annealer, motivating the study of methods to…
In this paper, we introduce stochastic simulated quantum annealing (SSQA) for large-scale combinatorial optimization problems. SSQA is designed based on stochastic computing and quantum Monte Carlo, which can simulate quantum annealing (QA)…
We present an efficient proposal for error-rejecting quantum computing with quantum dots (QD) embedded in single-sided optical microcavities based on the interface between the circularly polarized photon and QDs. An almost unity fidelity of…
An unexpected breakdown in the existing theory of quantum serial turbo coding is that a quantum convolutional encoder cannot simultaneously be recursive and non-catastrophic. These properties are essential for quantum turbo code families to…
We explore the potential application of quantum annealing to address the protein structure problem. To this end, we compare several proposed ab initio protein folding models for quantum computers and analyze their scaling and performance…
Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to…
Quantum annealing is a promising approach for solving combinatorial optimization problems. However, its performance is often limited by the overhead of additional qubits required for embedding logical QUBO models onto quantum annealers.…
Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…
We propose a framework to solve non-linear and history-dependent mechanical problems based on a hybrid classical computer -- quantum annealer approach. Quantum Computers are anticipated to solve particular operations exponentially faster.…
One of the main bottlenecks in solving combinatorial optimization problems with quantum annealers is the qubit connectivity in the hardware. A possible solution for larger connectivty is minor embedding. This techniques makes the…
The implementation of practical error correction protocols is essential for deployment of quantum information technologies. Ways of exploiting high-spin nuclei, which have multi-level quantum resources, have attracted interest in this…
Quantum computing is emerging as a promising tool in nuclear physics. However, the cost of encoding fermionic operators hampers the application of algorithms in current noisy quantum devices. In this work, we analyze an encoding scheme…