Quantum Computation of a Complex System : the Kicked Harper Model

The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting phenomena such as fractal spectra, mixed phase space, dynamical localization, anomalous diffusion, or partial delocalization, and can describe electrons in a magnetic field. Three different quantum algorithms are presented and analyzed, enabling to simulate efficiently the evolution operator of this system with different precision using different resources. Depending on the parameters chosen, the system is near-integrable, localized, or partially delocalized. In each case we identify transport or spectral quantities which can be obtained more efficiently on a quantum computer than on a classical one. In most cases, a polynomial gain compared to classical algorithms is obtained, which can be quadratic or less depending on the parameter regime. We also present the effects of static imperfections on the quantities selected, and show that depending on the regime of parameters, very different behaviors are observed. Some quantities can be obtained reliably with moderate levels of imperfection, whereas others are exponentially sensitive to imperfection strength. In particular, the imperfection threshold for delocalization becomes exponentially small in the partially delocalized regime. Our results show that interesting behavior can be observed with as little as 7-8 qubits, and can be reliably measured in presence of moderate levels of internal imperfections

Radiative levitation: a likely explanation for pulsations in the unique hot O subdwarf star SDSS J160043.6+074802.9

Context. SDSS J160043.6+074802.9 (J1600+0748 for short) is the only hot sdO star for which unambiguous multiperiodic luminosity variations have been reported so far. These rapid variations, with periods in the range from ~60 s to ~120 s, are best qualitatively explained in terms of pulsational instabilities, but the exact nature of the driving mechanism has remained a puzzle. Aims. Our primary goal is to examine quantitatively how pulsation modes can be excited in an object such as J1600+0748. Given the failure of uniform-metallicity models as well documented in the recent Ph.D. thesis of C. Rodríguez-López, we consider the effects of radiative levitation on iron as a means to boost the efficiency of the opacity-driving mechanism in models of J1600+0748. Methods. We combine high sensitivity time-averaged optical spectroscopy and full nonadiabatic calculations to carry out our study. In the first instance, this is used to estimate the location of J1600+0748 in the log $g-T_{\rm eff}$ plane. Given this essential input, we pulsate stellar models consistent with these atmospheric parameters. We construct both uniform-metallicity models and structures in which the iron abundance is specified by the condition of diffusive equilibrium between gravitational settling and radiative levitation. Results. On the basis of NTLE H/He synthetic spectra, we find that the target star has the following atmospheric parameters: log g = 5.93 $\pm$ 0.11, $T_{\rm eff}$ = 71 070 $\pm$ 2725 K, and log N(He)/N(H) = -0.85 $\pm$ 0.08. This takes into account our deconvolution of the spectrum of J1600+0748 as it is polluted by the light of a main sequence companion. We confirm that uniform-metallicity stellar models with Z in the range from 0.02 to 0.10 cannot excite pulsation modes of the kind observed. On the other hand, we find that the inclusion of radiative levitation, as we implemented it, leads to pulsational instabilities in a period range that overlaps with, although it is narrower than, the observed range in J1600+0748. The excited modes correspond to low-order, low-degree p-modes. Conclusions. We infer that radiative levitation is a likely essential ingredient in the excitation physics at work in J1600+0748

Evidence for a merger of binary white dwarfs: the case of GD 362

GD 362 is a massive white dwarf with a spectrum suggesting a H-rich atmosphere which also shows very high abundances of Ca, Mg, Fe and other metals. However, for pure H-atmospheres the diffusion timescales are so short that very extreme assumptions have to be made to account for the observed abundances of metals. The most favored hypothesis is that the metals are accreted from either a dusty disk or from an asteroid belt. Here we propose that the envelope of GD 362 is dominated by He, which at these effective temperatures is almost completely invisible in the spectrum. This assumption strongly alleviates the problem, since the diffusion timescales are much larger for He-dominated atmospheres. We also propose that the He-dominated atmosphere of GD 362 is likely to be the result of the merger of a binary white dwarf.Comment: 4 pages, 3 figures. Accepted for publication in Astrophysical Journal Letter

Pulsation in carbon-atmosphere white dwarfs: A new chapter in white dwarf asteroseismology

We present some of the results of a survey aimed at exploring the asteroseismological potential of the newly-discovered carbon-atmosphere white dwarfs. We show that, in certains regions of parameter space, carbon-atmosphere white dwarfs may drive low-order gravity modes. We demonstrate that our theoretical results are consistent with the recent exciting discovery of luminosity variations in SDSS J1426+5752 and some null results obtained by a team of scientists at McDonald Observatory. We also present follow-up photometric observations carried out by ourselves at the Mount Bigelow 1.6-m telescope using the new Mont4K camera. The results of follow-up spectroscopic observations at the MMT are also briefly reported, including the surprising discovery that SDSS J1426+5752 is not only a pulsating star but that it is also a magnetic white dwarf with a surface field near 1.2 MG. The discovery of $g$-mode pulsations in SDSS J1426+5752 is quite significant in itself as it opens a fourth asteroseismological "window", after the GW Vir, V777 Her, and ZZ Ceti families, through which one may study white dwarfs.Comment: 7 pages, 4 figures, to appear in Journal of Physics Conference Proceedings for the 16th European White Dwarf Worksho

Single-Step Quantum Search Using Problem Structure

The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evaluation of problem properties. The structure of random k-SAT allows determining the asymptotic average behavior of these algorithms, showing they improve on quantum algorithms, such as amplitude amplification, that ignore detailed problem structure but remain exponential for hard problem instances. Compared to good classical methods, the algorithm performs better, on average, for weakly and highly constrained problems but worse for hard cases. The analytic techniques introduced here also apply to other quantum algorithms, supplementing the limited evaluation possible with classical simulations and showing how quantum computing can use ensemble properties of NP search problems.Comment: 39 pages, 12 figures. Revision describes further improvement with multiple steps (section 7). See also http://www.parc.xerox.com/dynamics/www/quantum.htm

Low Cost and Compact Quantum Cryptography

We present the design of a novel free-space quantum cryptography system, complete with purpose-built software, that can operate in daylight conditions. The transmitter and receiver modules are built using inexpensive off-the-shelf components. Both modules are compact allowing the generation of renewed shared secrets on demand over a short range of a few metres. An analysis of the software is shown as well as results of error rates and therefore shared secret yields at varying background light levels. As the system is designed to eventually work in short-range consumer applications, we also present a use scenario where the consumer can regularly 'top up' a store of secrets for use in a variety of one-time-pad and authentication protocols.Comment: 18 pages, 9 figures, to be published in New Journal of Physic

A Lower Bound for Quantum Phase Estimation

We obtain a query lower bound for quantum algorithms solving the phase estimation problem. Our analysis generalizes existing lower bound approaches to the case where the oracle Q is given by controlled powers Q^p of Q, as it is for example in Shor's order finding algorithm. In this setting we will prove a log (1/epsilon) lower bound for the number of applications of Q^p1, Q^p2, ... This bound is tight due to a matching upper bound. We obtain the lower bound using a new technique based on frequency analysis.Comment: 7 pages, 1 figur

Unconditionally secure quantum bit commitment is impossible

The claim of quantum cryptography has always been that it can provide protocols that are unconditionally secure, that is, for which the security does not depend on any restriction on the time, space or technology available to the cheaters. We show that this claim does not hold for any quantum bit commitment protocol. Since many cryptographic tasks use bit commitment as a basic primitive, this result implies a severe setback for quantum cryptography. The model used encompasses all reasonable implementations of quantum bit commitment protocols in which the participants have not met before, including those that make use of the theory of special relativity.Comment: 4 pages, revtex. Journal version replacing the version published in the proceedings of PhysComp96. This is a significantly improved version which emphasis the generality of the resul

Exactness of the Original Grover Search Algorithm

It is well-known that when searching one out of four, the original Grover's search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover's algorithm definitely not exact? In this article we give a complete answer to this question through some rationality results of trigonometric functions.Comment: 8 pages, 2 figure

Insecurity of Quantum Secure Computations

It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller machines from learning the PIN (Personal Identification Number) from the customers' input. Although such optimism has been challenged by the recent surprising discovery of the insecurity of the so-called quantum bit commitment, the security of quantum two-party computation itself remains unaddressed. Here I answer this question directly by showing that all ``one-sided'' two-party computations (which allow only one of the two parties to learn the result) are necessarily insecure. As corollaries to my results, quantum one-way oblivious password identification and the so-called quantum one-out-of-two oblivious transfer are impossible. I also construct a class of functions that cannot be computed securely in any ``two-sided'' two-party computation. Nevertheless, quantum cryptography remains useful in key distribution and can still provide partial security in ``quantum money'' proposed by Wiesner.Comment: The discussion on the insecurity of even non-ideal protocols has been greatly extended. Other technical points are also clarified. Version accepted for publication in Phys. Rev.