Search results for "Algorithm"
showing 10 items of 4887 documents
Localization and diffusion in Ising-type quantum networks
2001
We investigate the effect of phase randomness in Ising-type quantum networks. These networks model a large class of physical systems. They describe micro- and nanostructures or arrays of optical elements such as beam splitters (interferometers) or parameteric amplifiers. Most of these stuctures are promising candidates for quantum information processing networks. We demonstrate that such systems exhibit two very distinct types of behaviour. For certain network configurations (parameters), they show quantum localization similar to Anderson localization whereas classical stochastic behaviour is observed in other cases. We relate these findings to the standard theory of quantum localization.
Simulation of many-qubit quantum computation with matrix product states
2006
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete problem. Errors inherent to truncations of the exact action of interacting gates are controlled by the size of the matrices in the representation. The property of finding the right solution for an instance and the expected value of the energy are found to be remarkably robust against these errors. As a symbolic example, we simulate the algorithm solving a 100-qubit hard instance, that is, finding the correct product state out of ~ 10^30 possibilities. Accum…
Measuring the heat exchange of a quantum process
2014
Very recently, interferometric methods have been proposed to measure the full statistics of work performed on a driven quantum system [Dorner et al. Phys. Rev. Lett. 110 230601 (2013)] and [Mazzola et al. Phys. Rev. Lett. 110 230602 (2013)]. The advantage of such schemes is that they replace the necessity to make projective measurements by performing phase estimation on an appropriately coupled ancilla qubit. These proposals are one possible route to the tangible experimental exploration of quantum thermodynamics, a subject which is the centre of much current attention due to the current control of mesoscopic quantum systems. In this Letter we demonstrate that a modification of the phase es…
Generating and Revealing a Quantum Superposition of Electromagnetic Field Binomial States in a Cavity
2007
We introduce the $N$-photon quantum superposition of two orthogonal generalized binomial states of electromagnetic field. We then propose, using resonant atom-cavity interactions, non-conditional schemes to generate and reveal such a quantum superposition for the two-photon case in a single-mode high-$Q$ cavity. We finally discuss the implementation of the proposed schemes.
Quantum Search with Multiple Walk Steps per Oracle Query
2015
We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk steps per query while only counting query time. As a result, we show that continuous-time quantum walks can outperform their discrete-time counterparts, even though both achieve quadratic speedups over their corresponding classical random walks. To provide greater equity, we allow the discrete-time quantum walk to also take multiple walk steps per oracle query while only counting queries. Then it matches the continuous-time algorithm's runtime, but such …
Breaking adiabatic quantum control with deep learning
2020
In the era of digital quantum computing, optimal digitized pulses are requisite for efficient quantum control. This goal is translated into dynamic programming, in which a deep reinforcement learning (DRL) agent is gifted. As a reference, shortcuts to adiabaticity (STA) provide analytical approaches to adiabatic speed up by pulse control. Here, we select single-component control of qubits, resembling the ubiquitous two-level Landau-Zener problem for gate operation. We aim at obtaining fast and robust digital pulses by combining STA and DRL algorithm. In particular, we find that DRL leads to robust digital quantum control with operation time bounded by quantum speed limits dictated by STA. I…
Quantum Error Correction with magnetic molecules
2014
Quantum algorithms often assume independent spin qubits to produce trivial $|\uparrow\rangle=|0\rangle$, $|\downarrow\rangle=|1\rangle$ mappings. This can be unrealistic in many solid-state implementations with sizeable magnetic interactions. Here we show that the lower part of the spectrum of a molecule containing three exchange-coupled metal ions with $S=1/2$ and $I=1/2$ is equivalent to nine electron-nuclear qubits. We derive the relation between spin states and qubit states in reasonable parameter ranges for the rare earth $^{159}$Tb$^{3+}$ and for the transition metal Cu$^{2+}$, and study the possibility to implement Shor's Quantum Error Correction code on such a molecule. We also disc…
Infinite projected entangled-pair state algorithm for ruby and triangle-honeycomb lattices
2018
The infinite Projected Entangled-Pair State (iPEPS) algorithm is one of the most efficient techniques for studying the ground-state properties of two-dimensional quantum lattice Hamiltonians in the thermodynamic limit. Here, we show how the algorithm can be adapted to explore nearest-neighbor local Hamiltonians on the ruby and triangle-honeycomb lattices, using the Corner Transfer Matrix (CTM) renormalization group for 2D tensor network contraction. Additionally, we show how the CTM method can be used to calculate the ground state fidelity per lattice site and the boundary density operator and entanglement entropy (EE) on an infinite cylinder. As a benchmark, we apply the iPEPS method to th…
Demonstration of a fully tuneable entangling gate for continuous-variable one-way quantum computation
2015
We introduce a fully tuneable entangling gate for continuous-variable one-way quantum computation. We present a proof-of-principle demonstration by propagating two independent optical inputs through a three-mode linear cluster state and applying the gate in various regimes. The genuine quantum nature of the gate is confirmed by verifying the entanglement strength in the output state. Our protocol can be readily incorporated into efficient multi-mode interaction operations in the context of large-scale one-way quantum computation, as our tuning process is the generalisation of cluster state shaping.
Quantum search by parallel eigenvalue adiabatic passage
2008
We propose a strategy to achieve the Grover search algorithm by adiabatic passage in a very efficient way. An adiabatic process can be characterized by the instantaneous eigenvalues of the pertaining Hamiltonian, some of which form a gap. The key to the efficiency is based on the use of parallel eigenvalues. This allows us to obtain non-adiabatic losses which are exponentially small, independently of the number of items in the database in which the search is performed.