相关论文: Tools for Quantum Algorithms

The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be…

The development of a universal fault-tolerant quantum computer that can solve efficiently various difficult computational problems is an outstanding challenge for science and technology. In this work, we propose a technique for an efficient…

There are quantum procedures that encode the solutions to a problem in the phases of quantum amplitudes. This happens in some quantum optimization algorithms in which the value of a function to be maximized or minimized is represented by a…

This paper focuses on the quantum amplitude estimation algorithm, which is a core subroutine in quantum computation for various applications. The conventional approach for amplitude estimation is to use the phase estimation algorithm, which…

Measurement is a fundamental operation in quantum computing and has many important use cases in quantum algorithms. This article provides a comprehensive overview of the basic measurement operations in quantum computing and represents a…

Modular quantum computing architectures require error correction schemes that remain effective in the presense of noisy inter-processor operations. We introduce a distributed quantum error correction framework based on approximate codes to…

This Perspective focuses on the several overlaps between quantum algorithms and Monte Carlo methods in the domains of physics and chemistry. We will analyze the challenges and possibilities of integrating established quantum Monte Carlo…

Natural frequencies and normal modes are basic properties of a structure which play important roles in analyses of its vibrational characteristics. As their computation reduces to solving eigenvalue problems, it is a natural arena for…

Quantum computers provide a super-exponential speedup for performing a Fourier transform over the symmetric group, an ability for which practical use cases have remained elusive so far. In this work, we leverage this ability to unlock…

These lecture notes aim to provide a clear and comprehensive introduction to using open quantum system theory for quantum algorithms. The main arguments are Variational Quantum Algorithms, Quantum Error Correction, Dynamical Decoupling and…

We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…

In this paper we present a quantum algorithm which increases the amplitude of the states corresponding to the solutions of the search problem by a factor of almost two.

There are major advantages in a newer version of Grover's quantum algorithm utilizing a general unitary transformation in the search of a single object in a large unsorted database. In this paper, we generalize this algorithm to multiobject…

Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8…

Structured decompositions of a desired unitary operator are employed to derive control schemes that achieve certain control objectives for finite-level quantum systems using only sequences of simple control pulses such as square waves with…

Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as "superposed quantum error mitigation",…

Algorithms to compute the quantum Fourier transform over a cyclic group are fundamental to many quantum algorithms. This paper describes such an algorithm and gives a proof of its correctness, tightening some claimed performance bounds…

Quantum computing is a promising paradigm that may overcome the current computational power bottlenecks. The increasing maturity of quantum processors provides more possibilities for the development and implementation of quantum algorithms.…

We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.

Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the…