Concept

Quantum Turing machine

Publications associées (11)

Creating and controlling exceptional points of non-Hermitian Hamiltonians via homodyne Lindbladian invariance

The exceptional points (EPs) of non-Hermitian Hamiltonians (NHHs) are spectral degeneracies associated with coalescing eigenvalues and eigenvectors, which are associated with remarkable dynamical properties. These EPs can be generated experimentally in ope ...

AMER PHYSICAL SOC2022

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

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Edoardo Charbon, Claudio Bruschini, Ivan Michel Antolovic, Mario Stipcevic

Harnessing quantum randomness for the generation of random numbers is an important concept crucial for information security and many other computer-related applications. Quantum random number generators (QRNGs) are evolving from bulky, slow, and expensive ...

SPIE2021

Thermoelasticity of Flexible Organic Crystals from Quasi-harmonic Lattice Dynamics: The Case of Copper(II) Acetylacetonate

Berend Smit, Seyedmohamad Moosavi, Daniele Ongari

A computationally affordable approach, based on quasi-harmonic lattice dynamics, is presented for the quantum-mechanical calculation of thermoelastic moduli of flexible, stimuli-responsive, organic crystals. The methodology relies on the simultaneous descr ...

2020

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

Path integral approach to the quantum fidelity amplitude

Jiri Vanicek

The Loschmidt echo is a measure of quantum irreversibility and is determined by the fidelity amplitude of an imperfect time-reversal protocol. Fidelity amplitude plays an important role both in the foundations of quantum mechanics and its applications, suc ...

Royal Soc2016

Communication: On the consistency of approximate quantum dynamics simulation methods for vibrational spectra in the condensed phase

Michele Ceriotti, Mariana Rossi Carvalho

Including quantum mechanical effects on the dynamics of nuclei in the condensed phase is challenging, because the complexity of exact methods grows exponentially with the number of quantum degrees of freedom. Efforts to circumvent these limitations can be ...

Amer Inst Physics2014

Is the Network Turing-Complete?

Dejan Kostic, Peter Peresini

Ensuring correct network behavior is hard. This is the case even for simple networks, and adding middleboxes only complicates this task. In this paper, we demonstrate a fundamental property of networks. Namely, we show a way of using a network to emulate t ...

2013

2D-TUCKER Is PPAD-Complete

Tucker's lemma states that if we triangulate the unit disc centered at the origin and color the vertices with {1, 1,2, 2} in an antipodal way (if vertical bar z vertical bar = 1, then the sum of the colors of z and -z is zero), then there must be an edge F ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Real-time computing without stable states: a new framework for neural computation based on perturbations

Henry Markram

A key challenge for neural modeling is to explain how a continuous stream of multimodal input from a rapidly changing environment can be processed by stereotypical recurrent circuits of integrate-and-fire neurons in real time. We propose a new computationa ...

2002

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