Catégorie

Theory of computation

Publications associées (1 000)

Quantum Error Correction and Simulation in Open Bosonic Systems

David Schlegel

Quantum computers have the potential to surpass conventional computing, but they are hindered by noise which induces errors that ultimately lead to the loss of quantum information. This necessitates the development of quantum error correction strategies fo ...
EPFL2024

Scalable Quantum Algorithms for Noisy Quantum Computers

Julien Sebastian Gacon

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition ...
EPFL2024

Quantum Protocols for ML, Physics, and Finance

Grzegorz Adam Gluch

In this thesis, we give new protocols that offer a quantum advantage for problems in ML, Physics, and Finance.Quantum mechanics gives predictions that are inconsistent with local realism.The experiment proving this fact (Bell, 1964) gives a quantum protoco ...
EPFL2024

Ultra-high quantum coherent and scalable superconducting circuit optomechanics, from topological lattices to quantum storage

Amir Youssefi

Mechanical oscillators can exhibit modes with ultra-low energy dissipation and compact form factors due to the slow velocity of acoustic waves, and are already used in applications ranging from timing to wireless filters. Over the past decade, novel ways i ...
EPFL2024

Electron-beam based nanoscale quantum controls

Hoda Shirzad

Advancing quantum technologies depends on the precise control of individual quantum systems, the so-called qubits, and the exploitation of their quantum properties. Nowadays, expanding the number of qubits to be entangled is at the core of the developments ...
EPFL2024

Mechanically induced correlated errors on superconducting qubits with relaxation times exceeding 0.4 ms

Tobias Kippenberg, Amir Youssefi, Marco Scigliuzzo, Mahdi Chegnizadeh, Shingo Kono, Xuxin Wang

Superconducting qubits are among the most advanced candidates for achieving fault-tolerant quantum computing. Despite recent significant advancements in the qubit lifetimes, the origin of the loss mechanism for state-of-the-art qubits is still subject to i ...
Nature Portfolio2024

Emergence of highly coherent two-level systems in a noisy and dense quantum network

Sandrine Gerber, Gabriel Aeppli

Quantum sensors and qubits are usually two-level systems (TLS), the quantum analogues of classical bits assuming binary values 0 or 1. They are useful to the extent to which superpositions of 0 and 1 persist despite a noisy environment. The standard prescr ...
Berlin2024

Three-wave-mixing quantum-limited kinetic inductance parametric amplifier operating at 6 T near 1 K

Pasquale Scarlino, Simone Frasca, Guillaume Beaulieu, Camille René Charles Roy

Parametric amplifiers play a crucial role in modern quantum technology by enabling the enhancement of weak signals with minimal added noise. Traditionally, Josephson junctions have been the primary choice for constructing parametric amplifiers. Nevertheles ...
2024

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving

Richard Lee Davis, Engin Walter Bumbacher, Jérôme Guillaume Brender

How to measure students' Computational Problem-Solving (CPS) competencies is an ongoing research topic. Prevalent approaches vary by measurement tools (e.g., interactive programming, multiple-choice tests, or programming-independent tests) and task types ( ...
Association for Computing Machinery2024

Empirical Sample Complexity of Neural Network Mixed State Reconstruction

Giuseppe Carleo, Filippo Vicentini, Haimeng Zhao

Quantum state reconstruction using Neural Quantum States has been proposed as a viable tool to reduce quantum shot complexity in practical applications, and its advantage over competing techniques has been shown in numerical experiments focusing mainly on ...
Verein Forderung Open Access Publizierens Quantenwissenschaf2024

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.