Related papers: Using a quantum computer to investigate quantum ch…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
We propose a quantum algorithm which uses the number of qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics described by the quantum sawtooth map. The numerical study of the effect of static…
Quantum chaos is usually characterized through its statistical implications on the energy spectrum of a given system. In this work we propose a decoherent mechanism for sensing quantum chaos. The chaotic nature of a many-body quantum system…
We present numerical and analytical studies of a quantum computer proposed by the Yamamoto group in Phys. Rev. Lett. 89, 017901 (2002). The stable and quantum chaos regimes in the quantum computer hardware are identified as a function of…
We present here a canonical quantization for the baker's map. The method we use is quite different from that used in Balazs and Voros (ref. \QCITE{cite}{}{BV}) and Saraceno (ref. \QCITE{cite}{}{S}). We first construct a natural ``baker…
Quantum computers, besides offering substantial computational speedups, are also expected to provide the possibility of preserving the privacy of a computation. Here we show the first such experimental demonstration of blind quantum…
We describe how one may go about performing quantum computation with arbitrary "quantum stuff", as long as it has some basic physical properties. Imagine a long strip of stuff, equipped with regularly spaced wires to provide input settings…
We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization and Anderson transition can be…
Through semiclassical methods the subject of quantum chaos motivates and depends on Hamiltonian chaos research. Presented here is a selection of Hamiltonian chaos topics that in this way get directly related to any of a variety of quantum…
Debugging quantum states transformations is an important task of modern quantum computing. The use of quantum tomography for these purposes significantly expands the range of possibilities. However, the presence of preparation and…
We define a class of dynamical systems on the sphere analogous to the baker map on the torus. The classical maps are characterized by dynamical entropy equal to ln 2. We construct and investigate a family of the corresponding quantum maps.…
Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle)…
We introduce groundbreaking techniques in image encryption, assuming the existence of quantum computing ressources functioning with qudits, where d is a power of 2. Our quantum representation of color multi-image is based on space-filling…
Within the last decade much progress has been made in the experimental realisation of quantum computing hardware based on a variety of physical systems. Rapid progress has been fuelled by the conviction that sufficiently powerful quantum…
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…
Quantum families of maps between quantum spaces are defined and studied. We prove that quantum semigroup (and sometimes quantum group) structures arise naturally on such objects out of more fundamental properties. As particular cases we…
It is suggested that the individual outcomes of a measurement process can be understood within standard quantum mechanics in terms of the measuring apparatus, treated as a quantum computer, executing Grover's search algorithm.
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
Quantum computers (QCs), which work based on the law of quantum mechanics, are expected to be faster than classical computers in several computational tasks such as prime factoring and simulation of quantum many-body systems. In the last…