Searcharxiv⌕ Search

arXiv subjects

Olivier Giraud

Publications and source records attributed to Olivier Giraud.

At least 37 records · Page 2Linked to original sources

Chaos-Assisted Long-Range Tunneling for Quantum Simulation

We present an extension of the chaos-assisted tunneling mechanism to spatially periodic lattice systems. We demonstrate that driving such lattice systems in an intermediate regime of modulation maps them onto tight-binding Hamiltonians with chaos-induced long-range hoppings $t_n \propto 1/n$ between sites at a distance $n$. We provide a numerical demonstration of the robustness of the results and derive an analytical prediction for the hopping term law. Such systems can thus be used to enlarge the scope of quantum simulations to experimentally realize long-range models of condensed matter.

quant-ph↗

Statistical properties of structured random matrices

Spectral properties of Hermitian Toeplitz, Hankel, and Toeplitz-plus-Hankel random matrices with independent identically distributed entries are investigated. Combining numerical and analytic arguments it is demonstrated that spectral statistics of all these random matrices is of intermediate type, characterized by (i) level repulsion at small distances, (ii) an exponential decrease of the nearest-neighbor distributions at large distances, (iii) a non-trivial value of the spectral compressibility, and (iv) the existence of non-trivial fractal dimensions of eigenvectors in Fourier space. Our findings show that intermediate-type statistics is more ubiquitous and universal than was considered so far and open a new direction in random matrix theory.

math-ph↗

Semiclassical evaluation of expectation values

Semiclassical Mechanics allows for a description of quantum systems which preserves their phase information, while using only the system's classical dynamics as an input. Over the time an identification has been developed between stationary phase approximation and semiclassical mechanics. Although it is true that in most of the cases in semiclassical mechanics the significant contributions come from the neighborhood of the stationary points, there are some important exceptions to it. In this paper we address one of these exceptions, occurring in the evaluation of the time evolution of the expectation value of an operator. We explain why it is necessary to include contributions which are not in the neighborhood of stationary points and provide new semiclassical expressions for the evolution of the expectation values. For our analysis we employ and discuss two major semiclassical tools. The first one is the association of the quantum evolution of a wavefunction to the classical evolution of a Lagrangian manifold, as done by Maslov. The second one is the derivation of an expression for the semiclassical Wigner function whose properties under canonical transformation are made explicit. Using the canonical invariance of the formalism, we derive an expression for the expectation value of observables for the one-dimensional case and then generalize it to higher dimensions. We find that the expression can be written as the sum of a classical contribution which corresponds to what is referred to as the Truncated Wigner Approximation (TWA) in the cold-atoms physics context, or the Linearized Semiclassical Initial Value Representation(LSC-IVR) in chemical or molecular physics, and additional terms associated with interferences. Along the way, we get a deeper understanding of the origin of these interference effects and an intuitive geometric picture associated with them.

quant-ph↗

Truncated moment sequences and a solution to the channel separability problem

We consider the problem of separability of quantum channels via the Choi matrix representation given by the Choi-Jamiołkowski isomorphism. We explore three classes of separability across different cuts between systems and ancillae and we provide a solution based on the mapping of the coordinates of the Choi state (in a fixed basis) to a truncated moment sequence (tms) $y$. This results in an algorithm which gives a separability certificate using semidefinite programming. The computational complexity and the performance of it depend on the number of variables $n$ in the tms and on the size of the moment matrix $M_t(y)$ of order $t$. We exploit the algorithm to numerically investigate separability of families of 2-qubit and single-qutrit channels; in the latter case we can provide an answer for examples explored earlier through the criterion based on the negativity $N$, a criterion which remains inconclusive for Choi matrices with $N=0$.

quant-ph↗

Optimal Detection of Rotations about Unknown Axes by Coherent and Anticoherent States

Coherent and anticoherent states of spin systems up to spin j=2 are known to be optimal in order to detect rotations by a known angle but unknown rotation axis. These optimal quantum rotosensors are characterized by minimal fidelity, given by the overlap of a state before and after a rotation, averaged over all directions in space. We calculate a closed-form expression for the average fidelity in terms of anticoherent measures, valid for arbitrary values of the quantum number j. We identify optimal rotosensors (i) for arbitrary rotation angles in the case of spin quantum numbers up to j=7/2 and (ii) for small rotation angles in the case of spin quantum numbers up to j=5. The closed-form expression we derive allows us to explain the central role of anticoherence measures in the problem of optimal detection of rotation angles for arbitrary values of j.

quant-ph↗

Multifractality of open quantum systems

We study the eigenstates of open maps whose classical dynamics is pseudointegrable and for which the corresponding closed quantum system has multifractal properties. Adapting the existing general framework developed for open chaotic quantum maps, we specify the relationship between the eigenstates and the classical structures, and quantify their multifractality at different scales. Based on this study, we conjecture that quantum states in such systems are distributed according to a hierarchy of classical structures, but are multifractal instead of ergodic at each level of the hierarchy. This is visible for sufficiently long-lived resonance states at scales smaller than the classical structures. Our results can guide experimentalists in order to observe multifractal behavior in open systems.

nlin.CD↗

Quantum Hamiltonian Computing protocols for molecular electronics Boolean logic gates

Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different designs, where the logical outputs are encoded either at fixed energy and spatial positioning of the quantum states, or at different energies. We use these results to construct quantum Boolean adders involving a minimal number of quantum states with the two designs. We also establish a matrix algebra giving an analogy between classical Boolean logic gates and quantum ones, and assess the possibilities of both designs for more complex gates.

quant-ph↗

Correlations of occupation numbers in the canonical ensemble and application to BEC in a 1D harmonic trap

We study statistical properties of $N$ non-interacting identical bosons or fermions in the canonical ensemble. We derive several general representations for the $p$-point correlation function of occupation numbers $\overline{n_1\cdots n_p}$. We demonstrate that it can be expressed as a ratio of two $p\times p$ determinants involving the (canonical) mean occupations $\overline{n_1}$, ..., $\overline{n_p}$, which can themselves be conveniently expressed in terms of the $k$-body partition functions (with $k\leq N$). We draw some connection with the theory of symmetric functions, and obtain an expression of the correlation function in terms of Schur functions. Our findings are illustrated by revisiting the problem of Bose-Einstein condensation in a 1D harmonic trap, for which we get analytical results. We get the moments of the occupation numbers and the correlation between ground state and excited state occupancies. In the temperature regime dominated by quantum correlations, the distribution of the ground state occupancy is shown to be a truncated Gumbel law. The Gumbel law, describing extreme value statistics, is obtained when the temperature is much smaller than the Bose-Einstein temperature.

cond-mat.stat-mech↗

Regularly Decomposable Tensors and Classical Spin States

A spin-$j$ state can be represented by a symmetric tensor of order $N=2j$ and dimension $4$. Here, $j$ can be a positive integer, which corresponds to a boson; $j$ can also be a positive half-integer, which corresponds to a fermion. In this paper, we introduce regularly decomposable tensors and show that a spin-$j$ state is classical if and only if its representing tensor is a regularly decomposable tensor. In the even-order case, a regularly decomposable tensor is a completely decomposable tensor but not vice versa; a completely decomposable tensors is a sum-of-squares (SOS) tensor but not vice versa; an SOS tensor is a positive semi-definite (PSD) tensor but not vice versa. In the odd-order case, the first row tensor of a regularly decomposable tensor is regularly decomposable and its other row tensors are induced by the regular decomposition of its first row tensor. We also show that complete decomposability and regular decomposability are invariant under orthogonal transformations, and that the completely decomposable tensor cone and the regularly decomposable tensor cone are closed convex cones. Furthermore, in the even-order case, the completely decomposable tensor cone and the PSD tensor cone are dual to each other. The Hadamard product of two completely decomposable tensors is still a completely decomposable tensor. Since one may apply the positive semi-definite programming algorithm to detect whether a symmetric tensor is an SOS tensor or not, this gives a checkable necessary condition for classicality of a spin-$j$ state. Further research issues on regularly decomposable tensors are also raised.

quant-ph↗

Entanglement and the truncated moment problem

We map the quantum entanglement problem onto the mathematically well-studied truncated moment problem. This yields a necessary and sufficient condition for separability that can be checked by a hierarchy of semi-definite programs. The algorithm always gives a certificate of entanglement if the state is entangled. If the state is separable, typically a certificate of separability is obtained in a finite number of steps and an explicit decomposition into separable pure states can be extracted.

quant-ph↗

Scaling theory of the Anderson transition in random graphs: ergodicity and universality

We study the Anderson transition on a generic model of random graphs with a tunable branching parameter $1<K\le 2$, through large scale numerical simulations and finite-size scaling analysis. We find that a single transition separates a localized phase from an unusual delocalized phase which is ergodic at large scales but strongly non-ergodic at smaller scales. In the critical regime, multifractal wavefunctions are located on few branches of the graph. Different scaling laws apply on both sides of the transition: a scaling with the linear size of the system on the localized side, and an unusual volumic scaling on the delocalized side. The critical scalings and exponents are independent of the branching parameter, which strongly supports the universality of our results.

cond-mat.stat-mech↗

Tensor eigenvalues and entanglement of symmetric states

Tensor eigenvalues and eigenvectors have been introduced in the recent mathematical literature as a generalization of the usual matrix eigenvalues and eigenvectors. We apply this formalism to a tensor that describes a multipartite symmetric state or a spin state, and we investigate to what extent the corresponding tensor eigenvalues contain information about the multipartite entanglement (or, equivalently, the classicality) of the state. This extends previous results connecting entanglement to spectral properties related to the state. While for spin-1 states the positivity of the smallest tensor eigenvalue is equivalent to separability, we show that for higher values of the angular momentum there is a correlation between entanglement and the value of the smallest tensor eigenvalue.

quant-ph↗

Partial transpose criteria for symmetric states

We express the positive partial transpose (PPT) separability criterion for symmetric states of multi-qubit systems in terms of matrix inequalities based on the recently introduced tensor representation for spin states. We construct a matrix from the tensor representation of the state and show that it is similar to the partial transpose of the density matrix written in the computational basis. Furthermore, the positivity of this matrix is equivalent to the positivity of a correlation matrix constructed from tensor products of Pauli operators. This allows for a more transparent experimental interpretation of the PPT criteria for an arbitrary spin-j state. The unitary matrices connecting our matrix to the partial transpose of the state generalize the so-called magic basis that plays a central role in Wootters' explicit formula for the concurrence of a 2-qubit system and the Bell bases used for the teleportation of a one or two-qubit state.

quant-ph↗

Average diagonal entropy in non-equilibrium isolated quantum systems

The diagonal entropy was introduced as a good entropy candidate especially for isolated quantum systems out of equilibrium. Here we present an analytical calculation of the average diagonal entropy for systems undergoing unitary evolution and an external perturbation in the form of a cyclic quench. We compare our analytical findings with numerical simulations of various many-body quantum systems. Our calculations elucidate various heuristic relations proposed recently in the literature.

quant-ph↗

Quantumness of spin-1 states

We investigate quantumness of spin-1 states, defined as the Hilbert-Schmidt distance to the convex hull of spin coherent states. We derive its analytic expression in the case of pure states as a function of the smallest eigenvalue of the Bloch matrix and give explicitly the closest classical state for an arbitrary pure state. Numerical evidence is provided that the exact formula for pure states provides an upper bound on the quantumness of mixed states. Due to the connection between quantumness and entanglement we obtain new insights into the geometry of symmetric entangled states.

quant-ph↗

High values of disorder-generated multifractals and logarithmically correlated processes

In the introductory section of the article we give a brief account of recent insights into statistics of high and extreme values of disorder-generated multifractals following a recent work by the first author with P. Le Doussal and A. Rosso (FLR) employing a close relation between multifractality and logarithmically correlated random fields. We then substantiate some aspects of the FLR approach analytically for multifractal eigenvectors in the Ruijsenaars-Schneider ensemble (RSE) of random matrices introduced by E. Bogomolny and the second author by providing an ab initio calculation that reveals hidden logarithmic correlations at the background of the disorder-generated multifractality. In the rest we investigate numerically a few representative models of that class, including the study of the highest component of multifractal eigenvectors in the Ruijsenaars-Schneider ensemble.

cond-mat.dis-nn↗

A universal set of qubit quantum channels

We investigate the set of quantum channels acting on a single qubit. We provide an alternative, compact generalization of the Fujiwara-Algoet conditions for complete positivity to non-unital qubit channels, which we then use to characterize the possible geometric forms of the pure output of the channel. We provide universal sets of quantum channels for all unital qubit channels as well as for all extremal (not necessarily unital) qubit channels, in the sense that all qubit channels in these sets can be obtained by concatenation of channels in the corresponding universal set. We also show that our universal sets are essentially minimal.

quant-ph↗

The game of go as a complex network

We study the game of go from a complex network perspective. We construct a directed network using a suitable definition of tactical moves including local patterns, and study this network for different datasets of professional tournaments and amateur games. The move distribution follows Zipf's law and the network is scale free, with statistical peculiarities different from other real directed networks, such as e. g. the World Wide Web. These specificities reflect in the outcome of ranking algorithms applied to it. The fine study of the eigenvalues and eigenvectors of matrices used by the ranking algorithms singles out certain strategic situations. Our results should pave the way to a better modelization of board games and other types of human strategic scheming.

cs.GT↗