Search results for "SIMULATION"
showing 10 items of 5095 documents
Hamiltonians defined by biorthogonal sets
2017
In some recent papers, the studies on biorthogonal Riesz bases has found a renewed motivation because of their connection with pseudo-hermitian Quantum Mechanics, which deals with physical systems described by Hamiltonians which are not self-adjoint but still may have real point spectra. Also, their eigenvectors may form Riesz, not necessarily orthonormal, bases for the Hilbert space in which the model is defined. Those Riesz bases allow a decomposition of the Hamiltonian, as already discussed is some previous papers. However, in many physical models, one has to deal not with o.n. bases or with Riesz bases, but just with biorthogonal sets. Here, we consider the more general concept of $\mat…
Quadratic ${\mathcal P}{\mathcal T}$-symmetric operators with real spectrum and similarity to self-adjoint operators
2012
It is established that a -symmetric elliptic quadratic differential operator with real spectrum is similar to a self-adjoint operator precisely when the associated fundamental matrix has no Jordan blocks.This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical devoted to ‘Quantum physics with non-Hermitian operators’.
Malliavin smoothness on the Lévy space with Hölder continuous or BV functionals
2020
Abstract We consider Malliavin smoothness of random variables f ( X 1 ) , where X is a pure jump Levy process and the function f is either bounded and Holder continuous or of bounded variation. We show that Malliavin differentiability and fractional differentiability of f ( X 1 ) depend both on the regularity of f and the Blumenthal–Getoor index of the Levy measure.
Random time-changes and asymptotic results for a class of continuous-time Markov chains on integers with alternating rates
2021
We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state probabilities of the random variables of the process. Moreover we study independent random time-changes with the inverse of the stable subordinator, the stable subordinator and the tempered stable subodinator. We also present some asymptotic results in the fashion of large deviations. These results give some generalizations of those presented in Di Crescenzo A., Macci C., Martinucci B. (2014).
Electron Fabry-Perot interferometer with two entangled magnetic impurities
2007
We consider a one-dimensional (1D) wire along which single conduction electrons can propagate in the presence of two spin-1/2 magnetic impurities. The electron may be scattered by each impurity via a contact-exchange interaction and thus a spin-flip generally occurs at each scattering event. Adopting a quantum waveguide theory approach, we derive the stationary states of the system at all orders in the electron-impurity exchange coupling constant. This allows us to investigate electron transmission for arbitrary initial states of the two impurity spins. We show that for suitable electron wave vectors, the triplet and singlet maximally entangled spin states of the impurities can respectively…
Classification of multipartite systems featuring only $|W\rangle$ and $|GHZ\rangle$ genuine entangled states
2015
In this paper we present several multipartite quantum systems featuring the same type of genuine (tripartite) entanglement. Based on a geometric interpretation of the so-called $|W\rangle$ and $|GHZ\rangle$ states we show that the classification of all multipartite systems featuring those and only those two classes of genuine entanglement can be deduced from earlier work of algebraic geometers. This classification corresponds in fact to classification of fundamental subadjoint varieties and establish a connection between those systems, well known in Quantum Information Theory and fundamental simple Lie algebras.
Grover Search with Lackadaisical Quantum Walks
2015
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertex is given $l$ self-loops, and we investigate its effects on Grover's algorithm when formulated as search for a marked vertex on the complete graph of $N$ vertices. For the discrete-time quantum walk using the phase flip coin, adding a self-loop to each vertex boosts the success probability from 1/2 to 1. Additional self-loops, however, decrease the success probability. Using instead the Ambainis, Kempe, and Rivosh (2005) coin, adding self-loops simply slows down the search. These coins also diffe…
Doubling the success of quantum walk search using internal-state measurements
2015
In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it doubles the success probability of many quantum spatial search algorithms. For example, this allows Grover's unstructured search problem to be solved with certainty, rather than with probability 1/2 if only the walker's position is measured, so the additional measurement yields a search algorithm that is twice as fast as without it, on average. Thus the internal state of discrete-time quantum walks holds valuable information that can be utilized to improve a…
Mathematical aspects of intertwining operators: the role of Riesz bases
2010
In this paper we continue our analysis of intertwining relations for both self-adjoint and not self-adjoint operators. In particular, in this last situation, we discuss the connection with pseudo-hermitian quantum mechanics and the role of Riesz bases.
Quantum Walk Search through Potential Barriers
2015
An ideal quantum walk transitions from one vertex to another with perfect fidelity, but in physical systems, the particle may be hindered by potential energy barriers. Then the particle has some amplitude of tunneling through the barriers, and some amplitude of staying put. We investigate the algorithmic consequence of such barriers for the quantum walk formulation of Grover's algorithm. We prove that the failure amplitude must scale as $O(1/\sqrt{N})$ for search to retain its quantum $O(\sqrt{N})$ runtime; otherwise, it searches in classical $O(N)$ time. Thus searching larger "databases" requires increasingly reliable hop operations or error correction. This condition holds for both discre…