We adapt the robust phase estimation algorithm to the evaluation of energy differences between two eigenstates using a quantum computer. This approach does not require controlled unitaries between auxiliary and system registers or even a single auxiliary qubit. As a proof of concept, we calculate the energies of the ground state and low-lying electronic excitations of a hydrogen molecule in a minimal basis on a cloud quantum computer. The denominative robustness of our approach is then quantified in terms of a high tolerance to coherent errors in the state preparation and measurement. Conceptually, we note that all quantum phase estimation algorithms ultimately evaluate eigenvalue differences.
We present a quantum algorithm to prepare the thermal Gibbs state of interacting quantum systems. This algorithm sets a universal upper bound D^alpha on the thermalization time of a quantum system, where D is the system's Hilbert space dimension and alpha < 1/2 is proportional to the Helmholtz free energy density of the system. We also derive an algorithm to evaluate the partition function of a quantum system in a time proportional to the system's thermalization time and inversely proportional to the targeted accuracy squared.
We propose a new method for evaluating NISQ devices. This paper has three distinct parts. First, we present a new quantum algorithm that solves a two hundred year old problem of finding quadratic nonresidues (QNR) in polynomial time. We show that QNR is in Exact Quantum Polynomial time, while it is still unknown whether QNR is in P. Second, we present a challenge to create a probability distribution over the quadratic nonresidues. Due to the theoretical complexity gap, a quantum computer can achieve a higher success rate than any known method on a classical computer. A device beating the class…
Investigating student interpretations of the differences between classical and quantum computers: Are quantum computers just analog classical computers?
We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced in a certain sense. The main new tool is a correspondence between a classical linear-algebraic model of computation, "span programs," and weighted bipartite graphs. A span program's evaluation corresponds to an eigenvalue-zero eigenvector of the associated graph. A quantum computer can therefore evaluate the span program by applying spectral estimation to th…
Evaluating the Quantum Approximate Optimization Algorithms for QUBO problems Across Quantum Hardware Platforms: Performance Analysis, Challenges, and Strategies
University of Oulu（奥卢大学）；Indian Institute of Science（印度科学学院）；OP Financial Group（OP金融集团）
The formula-evaluation problem is defined recursively. A formula's evaluation is the evaluation of a gate, the inputs of which are themselves independent formulas. Despite this pure recursive structure, the problem is combinatorially difficult for classical computers. A quantum algorithm is given to evaluate formulas over any finite boolean gate set. Provided that the complexities of the input subformulas to any gate differ by at most a constant factor, the algorithm has optimal query complexity. After efficient preprocessing, it is nearly time optimal. The algorithm is derived using the span …
We develop in the weak coupling approximation a quasi-non-Markovian master equation and study the phenomenon of decoherence during the operation of a controlled-not (CNOT) quantum gate in a quantum computer model formed by a linear chain of three nuclear spins system with second neighbor Ising interaction between them. We compare with the behavior of the Markovian counterpart for temperature different from zero (thermalization) and at zero temperature for low and high dissipation rates. At low dissipation there is a very small difference between Markovian and quasi no-Markovian at any temperat…
Quantum computers (QCs) must implement quantum error correcting codes (QECCs) to protect their logical qubits from errors, and modeling the effectiveness of QECCs on QCs is an important problem for evaluating the QC architecture. The previously developed Monte Carlo (MC) error models may take days or weeks of execution to produce an accurate result due to their random sampling approach. We present an alternative analytical error model that generates, over the course of executing the quantum program, a probability tree of the QC's error states. By calculating the fidelity of the quantum program…
Following the recent great advance of quantum computing technology, there are growing interests in its applications to industries, including finance. In this paper, we focus on derivative pricing based on solving the Black-Scholes partial differential equation by finite difference method (FDM), which is a suitable approach for some types of derivatives but suffers from the {\it curse of dimensionality}, that is, exponential growth of complexity in the case of multiple underlying assets. We propose a quantum algorithm for FDM-based pricing of multi-asset derivative with exponential speedup with…
We investigate the sampling efficiency for the simulations of quantum many-body systems at finite temperatures when initial sampling states are generated by applying Trotter gates to random phase product states (RPPSs). We restrict the number of applications of Trotter gates to be proportional to the system size, and thus the preparation would be easily accomplished in fault-tolerant quantum computers. When the Trotter gates are made from a nonintegrable Hamiltonian, we observe that the sampling efficiency increases with system size. This trend means that almost ideal sampling of initial state…
A new algorithm which is called Store-zechin, and utilizes stored data repetitively for calculating the permanent of an n * n matrix is proposed. The analysis manifests that the numbers of multiplications and additions taken by the new algorithm are respectively far smaller than those taken by the famous Ryser algorithm. Especially, for a 5-boson sampling task, the running time of the Store-zechin algorithm computing the correspondent permanent on ENIAC as well as TRADIC is lower than that of the sampling operation on a multiphoton boson sampling machine (shortly MPBSM), and thus MPBSM does no…
It is shown that under reasonable assumptions a Drake-style equation can be obtained for the probability that our universe is the result of a deliberate simulation. Evaluating loose bounds for certain terms in the equation shows that the probability is unlikely to be as high as previously reported in the literature, especially in a scenario where the simulations are recursive. Furthermore, we investigate the possibility of eavesdropping from the outside of such a simulation and introduce a general attack that can circumvent attempts at quantum cryptography inside the simulation, even if the qu…
