相关论文: Rapid solution of problems by nuclear-magnetic-res…

Recently developed quantum algorithms suggest that in principle, quantum computers can solve problems such as simulation of physical systems more efficiently than classical computers. Much remains to be done to implement these conceptual…

One of the most promising techniques used for studying the electronic properties of materials is based on Density Functional Theory (DFT) approach and its extensions. DFT has been widely applied in traditional solid state physics problems…

Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to…

A multiple round quantum dense coding (MRQDC) scheme based on the quantum phase estimation algorithm is proposed. Using an $m+1$ qubit system, Bob can transmit $2^{m+1}$ messages to Alice, through manipulating only one qubit and exchanging…

Although substantial progress has been achieved in solving quantum impurity problems, the numerical renormalization group (NRG) method generally performs poorly when applied to quantum lattice systems in a real-space blocking form. The…

Quantum computing is a game-changing technology for global academia, research centers and industries including computational science, mathematics, finance, pharmaceutical, materials science, chemistry and cryptography. Although it has seen…

Quantum computing (QC) has gained popularity due to its unique capabilities that are quite different from that of classical computers in terms of speed and methods of operations. This paper proposes hybrid models and methods that…

Quantum computing using two-dimensional NMR has recently been described using scalar coupling evolution technique [J. Chem. Phys.,109,10603 (1998)]. In the present paper, we describe two-dimensional NMR quantum computing with the help of…

Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of the fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., the so-called nonadiabatic…

Neural-network quantum states (NQS) employ artificial neural networks to encode many-body wave functions in second quantization through variational Monte Carlo (VMC). They have recently been applied to accurately describe electronic wave…

In recent years, efficient quantum circuit simulations incorporating ideal noise assumptions have relied on tensor network simulators, particularly leveraging the matrix product density operator (MPDO) framework. However, experiments on…

Characterisation protocols have so far played a central role in the development of noisy intermediate-scale quantum (NISQ) computers capable of impressive quantum feats. This trajectory is expected to continue in building the next…

NP-hard problems are not believed to be exactly solvable through general polynomial time algorithms. Hybrid quantum-classical algorithms to address such combinatorial problems have been of great interest in the past few years. Such…

Quantum error mitigation(QEM), an error suppression strategy without the need for additional ancilla qubits for noisy intermediate-scale quantum~(NISQ) devices, presents a promising avenue for realizing quantum speedups of quantum computing…

Photonic measurement-based quantum computation (MBQC) is a promising route towards fault-tolerant universal quantum computing. A central challenge in this effort is the huge overhead in the resources required for the construction of large…

Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating…

Entanglement is widely believed to lie at the heart of the advantages offered by a quantum computer. This belief is supported by the discovery that a noiseless (pure) state quantum computer must generate a large amount of entanglement in…

We examine the "Guessing Secrets" problem arising in internet routing, in which the goal is to discover two or more objects from a known finite set. We propose a quantum algorithm using O(1) calls to an O(logN) oracle. This improves upon…

One of the most well-established codes for modeling non-linear Magnetohydrodynamics (MHD) for tokamak reactors is JOREK, which solves these equations with a B\'ezier surface based finite element method. This code produces a highly sparse…

Vector set orthogonal normalization and matrix QR decomposition are fundamental problems in matrix analysis with important applications in many fields. We know that Gram-Schmidt process is a widely used method to solve these two problems.…