Publications associées à Oracle (machine de Turing)

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

Giovanni De Micheli, Mathias Soeken, Giulia Meuli

We present a constructive method to create quantum circuits that implement oracles vertical bar x vertical bar y |0 (k) -> vertical bar x vertical bar y circle plus f(x)vertical bar 0 (k) for n-variable Boolean functions f with low T-count. In our method f ...

IEEE2019

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

Serge Vaudenay, Fatma Betül Durak

Following up mass surveillance and privacy issues, modern secure communication protocols now seek more security such as forward secrecy and post-compromise security. They cannot rely on an assumption such as synchronization, predictable sender/receiver rol ...

Springer2019

Engineering and integration risks arising from advanced magnetic divertor configurations

Holger Reimerdes, Seungkyu Ha

The divertor configuration defines the power exhaust capabilities of DEMO as one of the major key design parameters and sets a number of requirements on the tokamak layout, including port sizes, poloidal field coil positions, and size of toroidal field coi ...

ELSEVIER SCIENCE SA2019

Distributed Optimization with Arbitrary Local Solvers

Martin Jaggi, Chenxin Ma

With the growth of data and necessity for distributed optimization methods, solvers that work well on a single machine must be re-designed to leverage distributed computation. Recent work in this area has been limited by focusing heavily on developing high ...

Taylor & Francis Ltd2017

Circular Security Reconsidered

Serge Vaudenay, Fatma Betül Durak

The notion of circular security of pseudorandom functions (PRF) was introduced in Distance Bounding Protocols. So far, only a construction based on a random oracle model was proposed. Circular security stands between two new notions which we call Key Depen ...

Springer International Publishing2016

Towards Tight Lower Bounds for Scheduling Problems

Ashkan Norouzi Fard, Abbas Bazzi

We show a close connection between structural hardness for k-partite graphs and tight inapproximability results for scheduling problems with precedence constraints. Assuming a natural but nontrivial generalisation of the bipartite structural hardness resul ...

Springer Int Publishing Ag2015

Beam-dynamics driven design of the LHeC energy-recovery linac

Dario Pellegrini, Andrea Latina

The LHeC is envisioned as a natural upgrade of the LHC that aims at delivering an electron beam for collisions with the existing hadronic beams. The current baseline design for the electron facility consists of a multipass superconducting energy-recovery l ...

Amer Physical Soc2015

Distributed machine learning in networks by consensus

Martin Hasler, Leonidas Georgopoulos

We propose an algorithm to learn from distributed data on a network of arbitrarily connected machines without exchange of the data-points. Parts of the dataset are processed locally at each machine, and then the consensus communication algorithm is employe ...

Elsevier2014

First electron-cloud studies at the Large Hadron Collider

César Octavio Domínguez Sánchez De La Blanca, Frank Zimmermann, Giovanni Rumolo

During the beam commissioning of the Large Hadron Collider (LHC) [LHC Design Report No. CERN-2004-003-V-1, 2004 [http://cds.cern.ch/record/782076?ln=en]; O. Bruning, H. Burkhardt, and S. Myers, Prog. Part. Nucl. Phys. 67, 705 (2012)] with 150, 75, 50, and ...

Amer Physical Soc2013

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.

Oracle (machine de Turing)

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

Engineering and integration risks arising from advanced magnetic divertor configurations

Distributed Optimization with Arbitrary Local Solvers

Circular Security Reconsidered

Towards Tight Lower Bounds for Scheduling Problems

GSN Cloud Storage and Processing

Beam-dynamics driven design of the LHeC energy-recovery linac

Distributed machine learning in networks by consensus

First electron-cloud studies at the Large Hadron Collider

Graph Chatbot

Chattez avec Graph Search

Bidirectional Asynchronous Ratcheted Key Agreement with Linear Complexity

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

Distributed Optimization with Arbitrary Local Solvers

Circular Security Reconsidered

GSN Cloud Storage and Processing

Beam-dynamics driven design of the LHeC energy-recovery linac

Towards Tight Lower Bounds for Scheduling Problems

Distributed machine learning in networks by consensus

Engineering and integration risks arising from advanced magnetic divertor configurations

First electron-cloud studies at the Large Hadron Collider