Concept

Fidelity of quantum states

Publications associées (14)

Efficient Preparation of Cyclic Quantum States

Giovanni De Micheli, Fereshte Mozafari Ghoraba

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

IEEE2022

Site-controlled quantum dots integrated with photonic crystal waveguides and cavities

Bruno Marie Dominique Rigal

Quantum mechanics did not only deeply transform our world view down to a philosophical level, it is also expected to be key ingredient of future so-called quantum technologies. Indeed, quantum properties of matter such as isolated single particles or entan ...

EPFL2018

The impact of classical control electronics on qubit fidelity

Edoardo Charbon, Fabio Sebastiano

Quantum processors rely on classical electronic controllers to manipulate and read out the quantum state. As the performance of the quantum processor improves, non-idealities in the classical controller can become the performance bottleneck for the whole q ...

2018

SAT-based {CNOT, T} Quantum Circuit Synthesis

Giovanni De Micheli, Mathias Soeken, Giulia Meuli

The prospective of practical quantum computers has lead researchers to investigate automatic tools to program them. A quantum program is modeled as a Clifford+T quantum circuit that needs to be optimized in order to comply with quantum technology constrain ...

2018

Quantum rectifier in a one-dimensional photonic channel

By using a fully quantum approach based on an input-output formulation of the stochastic Schrodinger equation, we show rectification of radiation fields in a one-dimensional waveguide doped with a pair of ideal two-level systems for three topical cases: cl ...

Amer Physical Soc2016

Efficient on-the-fly ab initio semiclassical method for computing time-resolved nonadiabatic electronic spectra with surface hopping or Ehrenfest dynamics

Jiri Vanicek, Tomas Zimmermann

We derive a somewhat crude, yet very efficient semiclassical approximation for computing nonadiabatic spectra. The resulting method, which is a generalization of the multiple-surface dephasing representation, includes quantum effects through interference o ...

American Institute of Physics2014

Initial or final values for semiclassical evolutions in the Weyl–Wigner representation

David Eduardo Zambrano Ramirez

Initial value representations are constructed to avoid the search for trajectories that are only defined in semiclassical approximations by their boundary conditions. We show how to incorporate these procedures within the full Weyl representation, so that ...

2013

Evaluation of the importance of spin-orbit couplings in the nonadiabatic quantum dynamics with quantum fidelity and with its efficient “on-the-fly” ab initio semiclassical approximation

Jiri Vanicek, Tomas Zimmermann

We propose to measure the importance of spin-orbit couplings (SOCs) in the nonadiabatic molecular quantum dynamics rigorously with quantum ﬁdelity. To make the criterion practical, quantum ﬁdelity is estimated efﬁciently with the multiple-surface dephasing ...

American Institute of Physics2012

Measuring nonadiabaticity of molecular quantum dynamics with quantum fidelity and with its efficient semiclassical approximation

Jiri Vanicek, Tomas Zimmermann

We propose to measure nonadiabaticity of molecular quantum dynamics rigorously with the quantum fidelity between the Born-Oppenheimer and fully nonadiabatic dynamics. It is shown that this measure of nonadiabaticity applies in situations where other criter ...

American Institute of Physics2012

On the Efficiency of Semiclassical and Classical Approximations of Quantum Fidelity in Many-Dimensional Systems

Cesare Mollica

This thesis is focused on classical and semiclassical approximations of a specific quantum time correlation function, the “quantum fidelity.” Namely, we rigorously study the efficiency of a continuous class of algorithms for the evaluation of its classical ...

EPFL2012

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search