Publication

An efficient quantum algorithm for the time evolution of parameterized circuits

Publications associées (51)

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

Towards a scalable quantum computer

Edoardo Charbon, Fabio Sebastiano

A quantum machine may solve some complex problems that are intractable for even the most powerful classical computers. By exploiting quantum superposition and entanglement phenomena, quantum algorithms can achieve from polynomial to exponential speed up wh ...

2018

15.5 Cryo-CMOS circuits and systems for scalable quantum computing

Edoardo Charbon, Harald Arjan Robert Homulle, Fabio Sebastiano

Quantum computing holds the promise to achieve unprecedented computation power and to solve problems today intractable. State-of-the-art quantum processors consist of arrays of quantum bits (qubits) operating at a very low base temperature, typically a few ...

2017

Today's rapid advances in the physical implementation of quantum computers demand for scalable synthesis methods in order to map practical logic designs to quantum architectures. We present a synthesis algorithm for quantum computing based on k-LUT network ...

IEEE2017

Design Automation and Design Space Exploration for Quantum Computers

Giovanni De Micheli, Mathias Soeken

A major hurdle to the deployment of quantum linear systems algorithms and recent quantum simulation algorithms lies in the difficulty to find inexpensive reversible circuits for arithmetic using existing hand coded methods. Motivated by recent advances in ...

Ieee2017

Avec Internet, l’espace a tant changé que la société est animée d’un mouvement dont la dynamique est peu lisible, car peu familière. Nier la réalité et la spatialité d’Internet expose à la déréalisation de nombre d’actions qui contribuent remarquablement à ...

2015

30 years of railway liberalization: what does it mean for us?

Matthias Finger

The aim of this text is to crystallize the challenges of European railway liberalization for Switzerland, as well as for the railway freight. In order to do that, I will proceed in three steps: I will first recall European railway liberalization. I will th ...

2012

While rigorous quantum dynamical simulations of many-body systems are extremely difficult (or impossible) due to exponential scaling with dimensionality, the corresponding classical simulations ignore quantum effects. Semiclassical methods are generally mo ...

American Physical Society2011

Relaxation Dynamics of Tryptophan in Water: A UV Fluorescence Up-Conversion and Molecular Dynamics Study

Majed Chergui, Frank van Mourik, Andrea Cannizzo, Ahmad Ajdar Zadeh Oskouei

We report on an ultrafast experimental and simulations study of the early relaxation events of photoexcited tryptophan in water. Experimentally, we used fluorescence up-conversion in both polychromatic and single wavelength detection modes in the 300-480 n ...

American Chemical Society2010

Time evolution of correlations in strongly interacting fermions after a quantum quench

Salvatore Manmana

Using the adaptive time-dependent density-matrix renormalization group, we study the time evolution of density correlations of interacting spinless fermions on a one-dimensional lattice after a sudden change in the interaction strength. Over a broad range ...

2009

Market Sharing Dynamics Between Two Service Providers

Max-Olivier Hongler, Olivier Gallay

We study the market partition between two distinct firms that deliver services to waiting-time sensitive customers. In our model, the incoming customers select a firm on the basis of its posted price, the expected waiting time and its brand. More specifica ...

Elsevier2008