arXiv subjects
Publications and source records attributed to R. Schack.
We derive a simple closed form for the matrix elements of the quantum baker's map that shows that the map is an approximate shift in a symbolic representation based on discrete phase space. We use this result to give a formal proof that the quantum baker's map approaches a classical Bernoulli shift in the limit of a small effective Plank's constant.
We present two complementary ways in which Saraceno's symmetric version of the quantum baker's map can be written as a shift map on a string of quantum bits. One of these representations leads naturally to a family of quantizations of the baker's map.
In a recent paper (quant-ph/9906015), Deutsch claims to derive the "probabilistic predictions of quantum theory" from the "non-probabilistic axioms of quantum theory" and the "non-probabilistic part of classical decision theory." We show that his derivation fails because it includes hidden probabilistic assumptions.
We present a general method for constructing pure-product-state representations for density operators of $N$ quantum bits. If such a representation has nonnegative expansion coefficients, it provides an explicit separable ensemble for the density operator. We derive the condition for separability of a mixture of the Greenberger-Horne-Zeilinger state with the maximally mixed state.
We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers of quantum bits, the quantum nature of NMR quantum computation lies in the ability to avoid an exponential signal decrease.
We give a constructive proof that all mixed states of N qubits in a sufficiently small neighborhood of the maximally mixed state are separable. The construction provides an explicit representation of any such state as a mixture of product states. We give upper and lower bounds on the size of the neighborhood, which show that its extent decreases exponentially with the number of qubits. We also discuss the implications of the bounds for NMR quantum computing.
Quantum state diffusion (QSD) as a tool to solve quantum-optical master equations by stochastic simulation can be made several orders of magnitude more efficient if states in Hilbert space are represented in a moving basis of excited coherent states. The large savings in computer memory and time are due to the localization property of the QSD equation. We show how the method can be used to compute spectra and give an application to second harmonic generation.
Numerical simulation of individual open quantum systems has proven advantages over density operator computations. Quantum state diffusion with a moving basis (MQSD) provides a practical numerical simulation method which takes full advantage of the localization of quantum states into wave packets occupying small regions of classical phase space. Following and extending the original proposal of Percival, Alber and Steimle, we show that MQSD can provide a further gain over ordinary QSD and other quantum trajectory methods of many orders of magnitude in computational space and time. Because of these gains, it is even possible to calculate an open quantum system trajectory when the corresponding isolated system is intractable. MQSD is particularly advantageous where classical or semiclassical dynamics provides an adequate qualitative picture but is numerically inaccurate because of significant quantum effects. The principles are illustrated by computations for the quantum Duffing oscillator and for second harmonic generation in quantum optics. Potential applications in atomic and molecular dynamics, quantum circuits and quantum computation are suggested.
Hypersensitivity to perturbation is a criterion for chaos based on the question of how much information about a perturbing environment is needed to keep the entropy of a Hamiltonian system from increasing. We demonstrate numerically that hypersensitivity to perturbation is present in the following quantum maps: the quantum kicked top, the quantum baker's map, the quantum lazy baker's map, and the quantum sawtooth and cat maps.
Using the method of symbolic dynamics, we show that a large class of classical chaotic maps exhibit exponential hypersensitivity to perturbation, i.e., a rapid increase with time of the information needed to describe the perturbed time evolution of the Liouville density, the information attaining values that are exponentially larger than the entropy increase that results from averaging over the perturbation. The exponential rate of growth of the ratio of information to entropy is given by the Kolmogorov-Sinai entropy of the map. These findings generalize and extend results obtained for the baker's map [R. Schack and C. M. Caves, Phys. Rev. Lett. 69, 3413 (1992)].
Given a list of $N$ states with probabilities $0<p_1\leq\cdots\leq p_N$, the average conditional algorithmic information $\bar I$ to specify one of these states obeys the inequality $H\leq\bar I<H+O(1)$, where $H=-\sum p_j\log_2p_j$ and $O(1)$ is a computer-dependent constant. We show how any universal computer can be slightly modified in such a way that the inequality becomes $H\leq\bar I<H+1$, thereby eliminating the computer-dependent constant from statistical physics.
We analyze a randomly perturbed quantum version of the baker's transformation, a prototype of an area-conserving chaotic map. By numerically simulating the perturbed evolution, we estimate the information needed to follow a perturbed Hilbert-space vector in time. We find that the Landauer erasure cost associated with this information grows very rapidly and becomes much larger than the maximum statistical entropy given by the logarithm of the dimension of Hilbert space. The quantum baker's map thus displays a hypersensitivity to perturbations that is analogous to behavior found earlier in the classical case. This hypersensitivity characterizes ``quantum chaos'' in a way that is directly relevant to statistical physics.
If p is the probability of a letter of a memoryless source, the length l of the corresponding binary Huffman codeword can be very different from the value -log p. We show that, nevertheless, for a typical letter, l is approximately equal to -log p. More precisely, the probability that l differs from -log p by more than m decreases exponentially with m.