相关论文: Numerical Analysis of Boosting Scheme for Scalable…

Understanding the limiting capabilities of classical methods in simulating complex quantum systems is of paramount importance for quantum technologies. Although many advanced approaches have been proposed and recently used to challenge…

We apply quantum model inspired on the classical Bayesian method also called mutual information to study the multipartite correlation in quantum images by using the flexible representation of quantum images (FRQI). This can be reflected by…

Finding ground states and low-lying excitations of a given Hamiltonian is one of the most important problems in many fields of physics. As a novel approach, quantum computing on Noisy Intermediate-Scale Quantum (NISQ) devices offers the…

Quantum computers hold great promise for arriving at exact simulations of nuclear dynamical processes (e.g., scattering and reactions) that are paramount to the study of nuclear matter at the limit of stability and to explaining the…

We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…

We propose a scalable quantum-computing architecture based on cold atoms confined to sites of a tight optical lattice. The lattice is placed in a non-uniform magnetic field and the resulting Zeeman sublevels define qubit states. Microwave…

The von Neumann entropy plays a vital role in quantum information theory. The von Neumann entropy determines, e.g., the capacities of quantum channels. Also, entropies of composite quantum systems are important for future quantum networks,…

The standard approach for path integral Monte Carlo simulations of open quantum systems is extended as an efficient tool to monitor the time evolution of coherences (off-diagonal elements of the reduced density matrix) also for strong…

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme, and Milburn, and makes use of an incremental…

In the noisy intermediate-scale quantum (NISQ) era, two-qubit gates in quantum circuits are more susceptible to noise than single-qubit gates. Therefore, reducing the number of two-qubit gates is crucial for improving circuit efficiency and…

Models for quantum computation with circuit connections subject to the quantum superposition principle have been recently proposed. There, a control quantum system can coherently determine the order in which a target quantum system…

We analytically investigate the robustness of the Bernstein--Vazirani algorithm in the presence of bit flip, phase flip, and depolarizing noise using the density matrix formalism. We derive the exact expressions for the algorithm's success…

We give out a proposal of quantum simulation of pairing model on an NMR quantum computer. In our proposal, we choose an appropriate initial state which can be easily prepared in experiment. Making use of feature of NMR measure and the…

Variational quantum algorithms is one of the most representative algorithms in quantum computing, which has a wide range of applications in quantum machine learning, quantum simulation and other related fields. However, they face challenges…

Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…

Quantum machine learning is among the most exciting potential applications of quantum computing. However, the vulnerability of quantum information to environmental noises and the consequent high cost for realizing fault tolerance has…

Current universal quantum computers have a limited number of noisy qubits. Because of this, it is difficult to use them to solve large-scale complex optimization problems. In this paper we tackle this issue by proposing a quantum…

A quantum algorithm to solve the parity problem is better than its most efficient classical counter- part with a separation that is polynomial in the number of queries. This was shown by E. Bernstein and U. Vazirani and was one of the…

Quantum simulations of chemistry in first quantization offer important advantages over approaches in second quantization including faster convergence to the continuum limit and the opportunity for practical simulations outside the…

We present a renormalization scheme which simplifies the dynamics of an important class of interacting multi-qubit systems. We show that a wide class of M+1 qubit systems can be reduced to an equivalent n+1 qubit system with n equal to, or…