Related papers: Quantum Spin Dynamics and Quantum Computation
Quantum computing is gaining increased attention as a potential way to speed up simulations of physical systems, and it is also of interest to apply it to simulations of classical plasmas. However, quantum information science is…
We propose a hybrid approach to simulate quantum many body dynamics by combining Trotter based quantum algorithm with classical dynamic mode decomposition. The interest often lies in estimating observables rather than explicitly obtaining…
A new method for nonperturbative investigations of quantum gravity is presented in which the simplicial path integral is approximated by the partition function of a spin system. This facilitates analytical and numerical computations…
The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…
It is proposed that the state space of a quantum object with a complicated discrete spectrum can be used as a basis for multiqubit recording and processing of information in a quantum computer. As an example, nuclear spin 3/2 is considered.…
We assess the potential of quantum computing to accelerate computation of central tasks in genomics, focusing on often-neglected theoretical limitations. We discuss state-of-the-art challenges of quantum search, optimization, and machine…
Digital quantum computers provide a computational framework for solving the Schr\"{o}dinger equation for a variety of many-particle systems. Quantum computing algorithms for the quantum simulation of these systems have recently witnessed…
We present a general algorithm, based on machine learning, which can create optimal unitary operators to implement quantum teleportation in any system with well-defined set of measurements in a relevant entangled basis. We illustrate it…
I investigate whether it would technologically and economically make sense to build database search engines based on Grover's quantum search algorithm. The answer is not fully conclusive but in my judgement rather negative.
In this chapter we explore the connection between mesoscopic physics and quantum computing. After giving a bibliography providing a general introduction to the subject of quantum information processing, we review the various approaches that…
Efficient simulations of quantum evolutions of spin-1/2 systems are relevant for ensemble quantum computation as well as in typical NMR experiments. We propose an efficient method to calculate the dynamics of an observable provided that the…
We provide a tight analysis of Grover's recent algorithm for quantum database searching. We give a simple closed-form formula for the probability of success after any given number of iterations of the algorithm. This allows us to determine…
Quantum simulators are controllable systems that can be used to simulate other quantum systems. Here we focus on the dynamics of a chain of molecular qubits with interposed antiferromagnetic dimers. We theoretically show that its dynamics…
This article highlights some of the key operating principles of Grover algorithm. These principles were used to develop a new oracle function, that illustrates the possibility of using Grover algorithm for solving more realistic and…
We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of…
There exist quantum algorithms that are more efficient than their classical counterparts; such algorithms were invented by Shor in 1994 and then Grover in 1996. A lack of invention since Grover's algorithm has been commonly attributed to…
Tensor network theory and quantum simulation are respectively the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks…
Algorithms are described for efficiently simulating quantum mechanical systems on quantum computers. A class of algorithms for simulating the Schrodinger equation for interacting many-body systems are presented in some detail. These…
We present an approach to simulating quantum computation based on a classical model that directly imitates discrete quantum systems. Qubits are represented as harmonic functions in a 2D vector space. Multiplication of qubit representations…
Quantum search algorithms are considered in the context of protein sequence comparison in biocomputing. Given a sample protein sequence of length m (i.e m residues), the problem considered is to find an optimal match in a large database…