Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEfficient Quantum Algorithm for Computing n-time Correlation Functions
156
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We propose a method for computing n-time correlation functions of arbitrary spinorial, fermionic, and bosonic operators, consisting of an efficient quantum algorithm that encodes these correlations in an initially added ancillary qubit for probe and control tasks. For spinorial and fermionic systems, the reconstruction of arbitrary n-time correlation functions requires the measurement of two ancilla observables, while for bosonic variables time derivatives of the same observables are needed. Finally, we provide examples applicable to different quantum platforms in the frame of the linear response theory.
rate research
Read More
We introduce the concept of embedding quantum simulators, a paradigm allowing the efficient quantum computation of a class of bipartite and multipartite entanglement monotones. It consists in the suitable encoding of a simulated quantum dynamics in the enlarged Hilbert space of an embedding quantum simulator. In this manner, entanglement monotones are conveniently mapped onto physical observables, overcoming the necessity of full tomography and reducing drastically the experimental requirements. Furthermore, this method is directly applicable to pure states and, assisted by classical algorithms, to the mixed-state case. Finally, we expect that the proposed embedding framework paves the way for a general theory of enhanced one-to-one quantum simulators.
We introduce a formalism for time-dependent correlation functions for systems whose evolutions are governed by non-Hermitian Hamiltonians of general type. It turns out that one can define two different types of time correlation functions. Both these definitions seem to be physically consistent while becoming equivalent only in certain cases. Moreover, when autocorrelation functions are considered, one can introduce another function defined as the relative difference between the two definitions. We conjecture that such a function can be used to assess the positive semi-definiteness of the density operator without computing its eigenvalues. We illustrate these points by studying analytically a number of models with two energy levels.
We present a scheme for simulating relativistic quantum physics in circuit quantum electrodynamics. By using three classical microwave drives, we show that a superconducting qubit strongly-coupled to a resonator field mode can be used to simulate the dynamics of the Dirac equation and Klein paradox in all regimes. Using the same setup we also propose the implementation of the Foldy-Wouthuysen canonical transformation, after which the time derivative of the position operator becomes a constant of the motion.
This book provides an introduction to the emerging field of quantum thermodynamics, with particular focus on its relation to quantum information and its implications for quantum computers and next generation quantum technologies. The text, aimed at graduate level physics students with a working knowledge of quantum mechanics and statistical physics, provides a brief overview of the development of classical thermodynamics and its quantum formulation in Chapter 1. Chapter 2 then explores typical thermodynamic settings, such as cycles and work extraction protocols, when the working material is genuinely quantum. Finally, Chapter 3 explores the thermodynamics of quantum information processing and introduces the reader to some more state-of-the-art topics in this exciting and rapidly developing research field.
$mathbb{Z}_d$ Parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case $d=2$. In contrast to Majorana fermions, braiding of parafermions with $d>2$ allows to perform an entangling gate. This has spurred interest in parafermions and a variety of condensed matter systems have been proposed as potential hosts for them. In this work, we study the computational power of braiding parafermions more systematically. We make no assumptions on the underlying physical model but derive all our results from the algebraical relations that define parafermions. We find a familiy of $2d$ representations of the braid group that are compatible with these relations. The braiding operators derived this way reproduce those derived previously from physical grounds as special cases. We show that if a $d$-level qudit is encoded in the fusion space of four parafermions, braiding of these four parafermions allows to generate the entire single-qudit Clifford group (up to phases), for any $d$. If $d$ is odd, then we show that in fact the entire many-qudit Clifford group can be generated.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
