arXiv subjects

B. Georgeot

Publications and source records attributed to B. Georgeot.

45 records · Page 3Linked to original sources

arXiv2001

Quantum computer inverting time arrow for macroscopic systems

A legend tells that once Loschmidt asked Boltzmann on what happens to his statistical theory if one inverts the velocities of all particles, so that, due to the reversibility of Newton's equations, they return from the equilibrium to a nonequilibrium initial state. Boltzmann only replied ``then go and invert them''. This problem of the relationship between the microscopic and macroscopic descriptions of the physical world and time-reversibility has been hotly debated from the XIXth century up to nowadays. At present, no modern computer is able to perform Boltzmann's demand for a macroscopic number of particles. In addition, dynamical chaos implies exponential growth of any imprecision in the inversion that leads to practical irreversibility. Here we show that a quantum computer composed of a few tens of qubits, and operating even with moderate precision, can perform Boltzmann's demand for a macroscopic number of classical particles. Thus, even in the regime of dynamical chaos, a realistic quantum computer allows to rebuild a specific initial distribution from a macroscopic state given by thermodynamic laws.

quant-ph↗

arXiv2001

Efficient quantum computing insensitive to phase errors

We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for exponentially many orbits even when the quantum fidelity drops to zero. Such phase-insensitive algorithms open new possibilities for computation on realistic quantum computers.

quant-ph↗

arXiv2001

Exponential Gain in Quantum Computing of Quantum Chaos and Localization

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 modelled efficiently on a quantum computer. We also show that a similar algorithm simulates efficiently classical chaos in certain area-preserving maps.

quant-ph↗

arXiv2001

Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat

We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with moderate imperfections is able to simulate accurately the unstable chaotic classical dynamics for long times. The algorithm can be easily implemented on systems of a few qubits.

quant-ph↗

arXiv2000

Waves attractors in rotating fluids: a paradigm for ill-posed Cauchy problems

In the limit of low viscosity, we show that the amplitude of the modes of oscillation of a rotating fluid, namely inertial modes, concentrate along an attractor formed by a periodic orbit of characteristics of the underlying hyperbolic Poincaré equation. The dynamics of characteristics is used to elaborate a scenario for the asymptotic behaviour of the eigenmodes and eigenspectrum in the physically relevant régime of very low viscosities which are out of reach numerically. This problem offers a canonical ill-posed Cauchy problem which has applications in other fields.

physics.flu-dyn↗

arXiv2000

Inertial waves in a rotating spherical shell: attractors and asymptotic spectrum

We investigate the asymptotic properties of inertial modes confined in a spherical shell when viscosity tends to zero. We first consider the mapping made by the characteristics of the hyperbolic equation (Poincaré's equation) satisfied by inviscid solutions. Characteristics are straight lines in a meridional section of the shell, and the mapping shows that, generically, these lines converge towards a periodic orbit which acts like an attractor. We then examine the relation between this characteristic path and eigensolutions of the inviscid problem and show that in a purely two-dimensional problem, convergence towards an attractor means that the associated velocity field is not square-integrable. We give arguments which generalize this result to three dimensions. We then consider the viscous problem and show how viscosity transforms singularities into internal shear layers which in general betray an attractor expected at the eigenfrequency of the mode. We find that there are nested layers, the thinnest and most internal layer scaling with $E^{1/3}$-scale, $E$ being the Ekman number. Using an inertial wave packet traveling around an attractor, we give a lower bound on the thickness of shear layers and show how eigenfrequencies can be computed in principle. Finally, we show that as viscosity decreases, eigenfrequencies tend towards a set of values which is not dense in $[0,2Ω]$, contrary to the case of the full sphere ($Ω$ is the angular velocity of the system). Hence, our geometrical approach opens the possibility of describing the eigenmodes and eigenvalues for astrophysical/geophysical Ekman numbers ($10^{-10}-10^{-20}$), which are out of reach numerically, and this for a wide class of containers.

physics.flu-dyn↗

arXiv2000

Emergence of Quantum Chaos in Quantum Computer Core and How to Manage It

We study the standard generic quantum computer model, which describes a realistic isolated quantum computer with fluctuations in individual qubit energies and residual short-range inter-qubit couplings. It is shown that in the limit where the fluctuations and couplings are small compared to one-qubit energy spacing the spectrum has a band structure and a renormalized Hamiltonian is obtained which describes the eigenstate properties inside one band. The studies are concentrated on the central band of the computer (``core'') with the highest density of states. We show that above a critical inter-qubit coupling strength, quantum chaos sets in, leading to quantum ergodicity of the computer eigenstates. In this regime the ideal qubit structure disappears, the eigenstates become complex and the operability of the computer is quickly destroyed. We confirm that the quantum chaos border decreases only linearly with the number of qubits n, although the spacing between multi-qubit states drops exponentially with n. The investigation of time-evolution in the quantum computer shows that in the quantum chaos regime, an ideal (noninteracting) state quickly disappears and exponentially many states become mixed after a short chaotic time scale for which the dependence on system parameters is determined. Below the quantum chaos border an ideal state can survive for long times and be used for computation. The results show that a broad parameter region does exist where the efficient operation of a quantum computer is possible.

quant-ph↗

arXiv2000

Quantum Chaos Border for Quantum Computing

We study a generic model of quantum computer, composed of many qubits coupled by short-range interaction. Above a critical interqubit coupling strength, quantum chaos sets in, leading to quantum ergodicity of the computer eigenstates. In this regime the noninteracting qubit structure disappears, the eigenstates become complex and the operability of the computer is destroyed. Despite the fact that the spacing between multi-qubit states drops exponentially with the number of qubits $n$, we show that the quantum chaos border decreases only linearly with $n$. This opens a broad parameter region where the efficient operation of a quantum computer remains possible.

quant-ph↗

arXiv1998

Integrability and Quantum Chaos in Spin Glass Shards

We study spin glass clusters ("shards") in a random transverse magnetic field, and determine the regime where quantum chaos and random matrix level statistics emerge from the integrable limits of weak and strong field. Relations with quantum phase transition are also discussed.

cond-mat↗