相关论文: Accuracy of Trace Formulas
We develop numerous results that characterize when a complex Hermitian matrix is Birkhoff-James orthogonal, in the trace norm, to a (Hermitian) positive semidefinite matrix or set of positive semidefinite matrices. For example, we develop a…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
There is a folkloric belief that a depth-$\Theta(m)$ quantum circuit is needed to estimate the trace of the product of $m$ density matrices (i.e., a multivariate trace), a subroutine crucial to applications in condensed matter and quantum…
Programmable quantum devices provide a platform to control the coherent dynamics of quantum wavefunctions. Here we experimentally realize adaptive monitored quantum circuits, which incorporate conditional feedback into non-unitary…
Precise and autonomous clocks are of fundamental interest and central importance to both foundational studies and practical applications. Here, we construct a blueprint for a quantum clock governed by time-independent interactions. By…
Our knowledge of quantum mechanics can satisfactorily describe simple, microscopic systems, but is yet to explain the macroscopic everyday phenomena we observe. Here we aim to shed some light on the quantum-to-classical transition as seen…
We study the problem of learning an unknown graph provided via an oracle using a quantum algorithm. We consider three query models. In the first model ("OR queries"), the oracle returns whether a given subset of the vertices contains any…
We introduce a general statistical learning theory for processes that take as input a classical random variable and output a quantum state. Our setting is motivated by the practical situation in which one desires to learn a quantum process…
Recent years have seen significant activity on the problem of using data for the purpose of learning properties of quantum systems or of processing classical or quantum data via quantum computing. As in classical learning, quantum learning…
The appearance of tracks, close to classical orbits, left by charged quantum particles propagating inside a detector, such as a cavity periodically illuminated by light pulses, is studied for a family of idealized models. In the…
Quantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. A common pattern underpinning quantum algorithms can be identified when quantum…
The quantization of the continous cat maps on the torus has led to rather pathological quantum objects [6]. The non-generic behaviour of this model has led some to conclude that the Correspondence Principle fails in this case [2]. In this…
Some typical quantization ambiguities of quantum geometry are studied within isotropic models. Since this allows explicit computations of operators and their spectra, one can investigate the effects of ambiguities in a quantitative manner.…
Exact sequences are a well known notion in homological algebra. We investigate here the more vague properties of 'homotopical exactness', appearing for instance in the fibre or cofibre sequence of a map. Such notions of exactness can be…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
In this thesis, we investigate whether quantum algorithms can be used in the field of machine learning for both long and near term quantum computers. We will first recall the fundamentals of machine learning and quantum computing and then…
We review recent progress in attaining a quantitative understanding of the scarring phenomenon, the non-random behavior of quantum wavefunctions near unstable periodic orbits of a classically chaotic system. The wavepacket dynamics…
We study the quantum walk in momentum space using a coin arranged in quasi-periodic sequences following a Fibonacci prescription. We build for this system a classical map based on the trace of the evolution operator. The sub-ballistic…
Since its first appearance in 1971, Gutzwiller's trace formula has been extended to systems with continuous symmetries, in which not all periodic orbits are isolated. In order to avoid the divergences occurring in connection with symmetry…
To prove presence of chaos for fractals, a new mathematical concept of abstract similarity is introduced. As an example, the space of symbolic strings on a finite number of symbols is proved to possess the property. Moreover, Sierpinski…