In the current era of noisy quantum devices, there is a need for quantum algorithms that are efficient and robust against noise. Towards this end, we introduce the projected cooling algorithm for quantum computation. The projected cooling algorithm is able to construct the localized ground state ...
Quantum computationFormalismWe first propose herein a novel parallel computation, even though today's algorithm methodology for quantum computing, for all of the combinations of values in variables of a logical function. Our concern so far has been to obtain an attribute of some function. In fact...
Quantum computation algorithm for many-body studies - Ovrum, Hjorth-Jensen - 2007 () Citation Context ...] and decomposing fermionic Hamiltonians into spin operators via the Jordan-Wigner transformation, the latter of which is particularly well-suited to treating the Heisenberg, Ising, or Hubbard...
Such machines, however, are still not sufficiently powerful to be a credible alternative to the classical ones. For this reason,hybrid computationwas proposed to exploit near-term devices to benefit from the performance boost expected from quantum technologies. Quantum variational algorithms [5,6] rep...
Quantum Computation and Quantum Information 第六章 Grover 算法是一种量子搜索算法,说到搜索算法,了解一些经典算法的旁友肯定会想到二分搜索(binary search)算法,二分搜索在有序数组中查找某一特定数据可以做到对数级别的复杂度,但如果目标是无序的呢?
In this section we discuss models for errors affecting quantum computations described by quantum algorithms. The primary goal of a quantum algorithm is to produce a desired quantum state starting from a classical input state such as | 0〉. To obtain the result of a computation, we perform a ...
1 However, the field of experimental quantum computing is yet at its infancy. The typical size of quantum chips for the reliable gate based quantum computation ranges from one to several tens of physical qubits, with the main limits posed by decoherence. Despite the imperfections, the algorithms...
Although quantum computers are predicted to have many commercial applications, less attention has been given to their potential for resolving foundational issues in quantum mechanics. Here we focus on quantum computers’ utility for the Consistent Histor
we give a quantum algorithm that finds collisions in arbitrary r-to-one functions after only O((N/r)^(1/3)) expected evaluations of the function. ... G Brassard,P Hoyer,A Tapp - Springer US 被引量: 259发表: 1997年 Polynomial time quantum algorithm for the computation of the unit gro...
In this paper, we propose a novel quantum-inspired evolutionary algorithm, called quantum-inspired Tabu search (QTS). QTS is based on the classical Tabu search and the characteristic of quantum computation such as superposition. We will present how we implement QTS to solve 0/1 knapsack problem...