Related papers: Applying Multi-qubit Correction to Frustrated Clus…

Cross-manifold clustering is a hard topic and many traditional clustering methods fail because of the cross-manifold structures. In this paper, we propose a Multiple Flat Projections Clustering (MFPC) to deal with cross-manifold clustering…

Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the…

Quantum computers are highly vulnerable to noise, necessitating the use of error-correcting codes to protect stored data. Errors must be continuously corrected over time to counteract decoherence using appropriate decoders. Therefore, fast…

Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…

As quantum computing hardware steadily increases in qubit count and quality, one important question is how to allocate these resources to mitigate the effects of hardware noise. In a transitional era between noisy small-scale and fully…

Quantum information processing offers dramatic speedups, yet is famously susceptible to decoherence, the process whereby quantum superpositions decay into mutually exclusive classical alternatives, thus robbing quantum computers of their…

Fault-tolerant quantum computation (FTQC) is expected to address a wide range of computational problems. To realize large-scale FTQC, it is essential to encode logical qubits using quantum error-correcting codes. High-rate concatenated…

Linear system solvers are widely used in scientific computing, with the primary goal of solving linear system problems. Classical iterative algorithms typically rely on the conjugate gradient method. The rise of quantum computing has…

Adiabatic Quantum Computing (AQC) is a relatively new subject in the world of quantum computing, let alone Physics. Inspiration for this project has come from recent controversy around D-Wave Systems in British Columbia, Canada, who claim…

In this brief paper, we go through the theoretical steps of the spectral clustering on quantum computers by employing the phase estimation and the amplitude amplification algorithms. We discuss circuit designs for each step and show how to…

Quantum Selected Configuration Interaction (QSCI) and an extended protocol known as Sample-based Quantum Diagonalization (SQD) have emerged as promising algorithms to solve the electronic Schr\"odinger equation with noisy quantum computers.…

High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementing high-rate codes at a scale that both frustrates classical…

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic…

Distributed quantum computing (DQC) is being actively investigated as a means of scaling the number of qubits across multiple connected quantum devices. This includes quantum circuit compilation and execution management on multiple quantum…

We introduce a method for solving combinatorial optimization problems on digital quantum computers, where we incorporate auxiliary counterdiabatic (CD) terms into the adiabatic Hamiltonian, while integrating bias terms derived from an…

Quantum computation with light, compared with other platforms, offers the unique benefit of natural high-speed operations at room temperature and large clock rate, but a big obstacle of photonics is the lack of strong nonlinearities which…

Mixed Integer Linear Programming (MILP) can be considered the backbone of the modern power system optimization process, with a large application spectrum, from Unit Commitment and Optimal Transmission Switching to verifying Neural Networks…

Solid-state spin qubits are a promising platform for quantum computation and quantum networks. Recent experiments have demonstrated high-quality control over multi-qubit systems, elementary quantum algorithms and non-fault-tolerant error…

A unitary coupled-cluster (UCC) form for the wavefunction in the variational quantum eigensolver has been suggested as a systematic way to go beyond the mean-field approximation and include electron correlation in solving quantum chemistry…

Quantum and Classical computers continue to work together in tight cooperation to solve difficult problems. The combination is thus suggested in recent times for decoding the Low Density Parity Check (LDPC) codes, for the next generation…