Related papers: Numerical Analysis of Boosting Scheme for Scalable…

Nonequilibrium dynamics of quantum many-body systems is challenging for classical computing, providing opportunities for demonstrating practical quantum computational advantage with analogue quantum simulators. Owing to the intimate…

Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…

Boosting is a general method to convert a weak learner (which generates hypotheses that are just slightly better than random) into a strong learner (which generates hypotheses that are much better than random). Recently, Arunachalam and…

We propose a new quantum-computing scheme using ultracold neutral ytterbium atoms in an optical lattice. The nuclear Zeeman sublevels define a qubit. This choice avoids the natural phase evolution due to the magnetic dipole interaction…

In this work, we proposed a smooth transition wave equation from a quantum to classical regime in the framework of von Neumann formalism for ensembles and then obtained an equivalent scaled equation. This led us to develop a scaled…

Immense interest in quantum computing has prompted development of electronic structure methods that are suitable for quantum hardware. However, the slow pace at which quantum hardware progresses, forces researchers to implement their ideas…

In this work, we demonstrate a practical application of noisy intermediate-scale quantum (NISQ) algorithms to enhance subroutines in the Black-Litterman (BL) portfolio optimization model. As a proof of concept, we implement a 12-qubit…

Quantum Computing in the Noisy Intermediate-Scale Quantum (NISQ) era has shown promising applications in machine learning, optimization, and cryptography. Despite the progress, challenges persist due to system noise, errors, and decoherence…

We demonstrate a technique for optimizing quantum circuits that is analogous to classical windowing. Specifically, we show that small table lookups can allow control qubits to be iterated in groups instead of individually. We present…

We study the entropy of small subsystems in thermalizing quantum many-body systems governed by local Hamiltonians. Assuming the eigenstate thermalization hypothesis, we derive an analytical formula for the von Neumann entropy of…

For a large number of tasks, quantum computing demonstrates the potential for exponential acceleration over classical computing. In the NISQ era, variable-component subcircuits enable applications of quantum computing. To reduce the…

It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classical computers. The chances for practical implementation,…

Variational Quantum Eigensolver (VQE) is widely used in near-term hardware. However, their performances remain limited by the poor trainability and are dependent on random parameter initialization. In this work, we propose a warm start…

Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…

Quantum phase estimation (QPE) is a promising quantum algorithm for obtaining molecular ground-state energies with chemical accuracy. However, its computational cost, dominated by the Hamiltonian 1-norm $\lambda$ and the cost of the block…

The numerical emulation of quantum physics and quantum chemistry often involves an intractable number of degrees of freedom and admits no known approximation in general form. In practice, representing quantum-mechanical states using…

The technique of combining multiple votes to enhance the quality of a decision is the core of boosting algorithms in machine learning. In particular, boosting provably increases decision quality by combining multiple weak…

As an ensemble scheme of solid-state NMR quantum computers the extension of Kane's many-qubits silicon scheme based on the array of 31 P donor atoms are spaced lengthwise of the strip gates is considered. The possible planar topology of…

Quantum computers have now appeared in our society and are utilized for the investigation of science and engineering. At present, they have been built as intermediate-size computers containing about fifty qubits and are weak against noise…

In this work we propose a high-quality decomposition approach for qubit routing by swap insertion. This optimization problem arises in the context of compiling quantum algorithms onto specific quantum hardware. Our approach decomposes the…