Concept

Codage superdense

Publications associées (32)

SU(4) topological resonating valence bond spin liquid on the square lattice

We generalize the construction of the spin-1/2 SU(2) resonating valence bond (RVB) state to the case of the self-conjugate 6 representation of SU(4). As for the case of SU(2) [J.-Y. Chen and D. Poilblanc, Phys. Rev. B 97, 161107(R) (2018)], we use the proj ...

2019

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

Practical erasure codes for storage systems: The study of entanglement codes, an approach that propagates redundancy to increase reliability and performance

Verónica del Carmen Estrada Galiñanes

This dissertation deals with the design of practical erasure codes for storage systems. Hardware and logical disk failures are a common source of system failures that may lead to data loss. Nevertheless, it is predicted that spinning disks would remain the ...

University of Neuchâtel2017

Polarization and Channel Ordering: Characterizations and Topological Structures

Rajai Nasser

Information theory is the field in which we study the fundamental limitations of communication. Shannon proved in 1948 that there exists a maximum rate, called capacity, at which we can reliably communicate information through a given channel. However, Sha ...

EPFL2017

Limits on Support Recovery With Probabilistic Models: An Information-Theoretic Framework

Volkan Cevher, Jonathan Mark Scarlett

The support recovery problem consists of determining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings, such as compressive sensing, subset selection in regression, and gro ...

Institute of Electrical and Electronics Engineers2017

Quantum information density scaling and qubit operation time constraints of CMOS silicon-based quantum computer architectures

Edoardo Charbon, Fabio Sebastiano

Even the quantum simulation of an apparently simple molecule such as Fe2S2 requires a considerable number of qubits of the order of 106, while more complex molecules such as alanine (C3H7NO2) require about a hundred times more. In order to assess such a mu ...

2017

Multiuser Random Coding Techniques for Mismatched Decoding

Jonathan Mark Scarlett, Albert Guillén i Fàbregas

This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multiple-access channel, an error exponent is obtained that is tight with respect to the ensem ...

Institute of Electrical and Electronics Engineers2016

Gate fidelity and coherence of an electron spin in an Si/SiGe quantum dot with micromagnet

Pasquale Scarlino

The gate fidelity and the coherence time of a quantum bit (qubit) are important benchmarks for quantum computation. We construct a qubit using a single electron spin in an Si/SiGe quantum dot and control it electrically via an artificial spin-orbit field f ...

2016

Limits on Support Recovery with Probabilistic Models: An Information-Theoretic Framework

Volkan Cevher, Jonathan Mark Scarlett

The support recovery problem consists of deter- mining a sparse subset of a set of variables that is relevant in generating a set of observations, and arises in a diverse range of settings such as group testing, compressive sensing, and subset selection in ...

2015

Secure Communication in Erasure Networks with State-feedback

László Czap

The security and efficiency of communication are two of the main concerns for networks of today and the future. Our understanding of how to efficiently send information over various channels and networks has significantly increased in the past decade (see ...

EPFL2014

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