arXiv subjects

Bertrand Georgeot

Publications and source records attributed to Bertrand Georgeot.

48 records · Page 3Linked to original sources

arXiv2010

Interaction of a propagating guided matter wave with a localized potential

We provide a theoretical framework to describe the interaction of a propagating guided matter wave with a localized potential in terms of quantum scattering in a confined environment. We analyze how this scattering correlates the longitudinal and transverse degrees of freedom and work out analytically the output state under the Born approximation using a Gaussian localized potential. In this limit, it is possible to engineer the potential and achieve coherent control of the output channels. The robustness of this approximation is studied by comparing the stationary scattering theory to numerical simulations involving incident wave packets. It remains valid in a domain of weak localized potential that is achievable experimentally. We infer a possible method to determine the longitudinal coherence length of a guided atom laser. Then, we detail the non-perturbative regime of the interaction of the guided matter wave with the localized potential using a coupled channel approach. This approach is worked out explicitly with a square potential. It yields new non-perturbative effects such as the occurrence of confinement-induced resonances. The perspectives opened by this work for experiments are discussed.

cond-mat.other↗

arXiv2010

Multifractal wave functions of simple quantum maps

We study numerically multifractal properties of two models of one-dimensional quantum maps, a map with pseudointegrable dynamics and intermediate spectral statistics, and a map with an Anderson-like transition recently implemented with cold atoms. Using extensive numerical simulations, we compute the multifractal exponents of quantum wave functions and study their properties, with the help of two different numerical methods used for classical multifractal systems (box-counting method and wavelet method). We compare the results of the two methods over a wide range of values. We show that the wave functions of the Anderson map display a multifractal behavior similar to eigenfunctions of the three-dimensional Anderson transition but of a weaker type. Wave functions of the intermediate map share some common properties with eigenfunctions at the Anderson transition (two sets of multifractal exponents, with similar asymptotic behavior), but other properties are markedly different (large linear regime for multifractal exponents even for strong multifractality, different distributions of moments of wave functions, absence of symmetry of the exponents). Our results thus indicate that the intermediate map presents original properties, different from certain characteristics of the Anderson transition derived from the nonlinear sigma model. We also discuss the importance of finite-size effects.

nlin.CD↗

arXiv2010

Quantum algorithm for exact Monte Carlo sampling

We build a quantum algorithm which uses the Grover quantum search procedure in order to sample the exact equilibrium distribution of a wide range of classical statistical mechanics systems. The algorithm is based on recently developed exact Monte Carlo sampling methods, and yields a polynomial gain compared to classical procedures.

quant-ph↗

arXiv2009

Delocalization transition for the Google matrix

We study the localization properties of eigenvectors of the Google matrix, generated both from the World Wide Web and from the Albert-Barabasi model of networks. We establish the emergence of a delocalization phase for the PageRank vector when network parameters are changed. In the phase of localized PageRank, a delocalization takes place in the complex plane of eigenvalues of the matrix, leading to delocalized relaxation modes. We argue that the efficiency of information retrieval by Google-type search is strongly affected in the phase of delocalized PageRank.

cs.IR↗

arXiv2009

Quantum circuit for three-qubit random states

We explicitly construct a quantum circuit which exactly generates random three-qubit states. The optimal circuit consists of three CNOT gates and fifteen single qubit elementary rotations, parametrized by fourteen independent angles. The explicit distribution of these angles is derived, showing that the joint distribution is a product of independent distributions of individual angles apart from four angles.

quant-ph↗

arXiv2008

Entropy of entanglement and multifractal exponents for random states

We relate the entropy of entanglement of ensembles of random vectors to their generalized fractal dimensions. Expanding the von Neumann entropy around its maximum we show that the first order only depends on the participation ratio, while higher orders involve other multifractal exponents. These results can be applied to entanglement behavior near the Anderson transition.

quant-ph↗

arXiv2007

How many CNOT gates does it take to generate a three-qubit state ?

The number of two-qubit gates required to transform deterministically a three-qubit pure quantum state into another is discussed. We show that any state can be prepared from a product state using at most three CNOT gates, and that, starting from the GHZ state, only two suffice. As a consequence, any three-qubit state can be transformed into any other using at most four CNOT gates. Generalizations to other two-qubit gates are also discussed.

quant-ph↗

arXiv2007

Interference versus success probability in quantum algorithms with imperfections

We study the influence of errors and decoherence on both the performance of Shor's factoring algorithm and Grover's search algorithm, and on the amount of interference in these algorithms using a recently proposed interference measure. We consider systematic unitary errors, random unitary errors, and decoherence processes. We show that unitary errors which destroy the interference destroy the efficiency of the algorithm, too. However, unitary errors may also create useless additional interference. In such a case the total amount of interference can increase, while the efficiency of the quantum computation decreases. For decoherence due to phase flip errors, interference is destroyed for small error probabilities, and converted into destructive interference for error probabilities approaching one, leading to success probabilities which can even drop below the classical value. Our results show that in general interference is necessary in order for a quantum algorithm to outperform classical computation, but large amounts of interference are not sufficient and can even lead to destructive interference with worse than classical success rates.

quant-ph↗

arXiv2005

A Quantitative Measure of Interference

We introduce an interference measure which allows to quantify the amount of interference present in any physical process that maps an initial density matrix to a final density matrix. In particular, the interference measure enables one to monitor the amount of interference generated in each step of a quantum algorithm. We show that a Hadamard gate acting on a single qubit is a basic building block for interference generation and realizes one bit of interference, an ``i-bit''. We use the interference measure to quantify interference for various examples, including Grover's search algorithm and Shor's factorization algorithm. We distinguish between ``potentially available'' and ``actually used'' interference, and show that for both algorithms the potentially available interference is exponentially large. However, the amount of interference actually used in Grover's algorithm is only about 3 i-bits and asymptotically independent of the number of qubits, while Shor's algorithm indeed uses an exponential amount of interference.

quant-ph↗

arXiv2004

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.

quant-ph↗

arXiv2003

Les ordinateurs quantiques affrontent le chaos

Quantum computers facing chaos. Quantum parallelism allows to perform computation in a radically new manner. A quantum computer based on these new principles may resolve certain problems exponentially faster than a classical computer. We discuss how quantum computers can simulate complex dynamics, in particularly the dynamics of chaotic systems, where the errors of classical computation grow exponentially fast. ----- Le parallelisme autorise par la mecanique quantique permet d'effectuer des calculs d'une maniere radicalement nouvelle. Un ordinateur quantique fonde sur ces principes pourrait resoudre certains problemes exponentiellement plus vite qu'un ordinateur classique. Nous discutons comment un ordinateur quantique realiste peut simuler une dynamique complexe, en particulier les systemes chaotiques ou les fautes de l'ordinateur classique croissent exponentiellement vite.

quant-ph↗

arXiv1997

Breit-Wigner width and participation ratio in finite interacting Fermi systems

For many-body Fermi systems we determine the dependence of the Breit-Wigner width and inverse participation ratio (IPR) on interaction strength U > Uc and energy excitation dE > dE_ch when a crossover from Poisson to Wigner-Dyson P(s)-statistics takes place. At U > Uc the eigenstates are composed of a large number of noninteracting states and even for U < Uc there is a regime where P(s) is close to the Poisson distribution but IPR >> 1.

cond-mat↗