Publication

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

Publications associées (39)

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

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

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

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

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Fereshte Mozafari Ghoraba

Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...

EPFL2023

Quantum circuits for solving local fermion-to-qubit map- pings

Giuseppe Carleo, Jannes Willy E. Nys

Local Hamiltonians of fermionic systems on a lattice can be mapped onto local qubit Hamiltonians. Maintaining the lo-cality of the operators comes at the ex-pense of increasing the Hilbert space with auxiliary degrees of freedom. In order to retrieve the l ...

VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF2023

Nano-MOSFET - Foundation of Quantum Computing Part I

Edoardo Charbon, Fabio Sebastiano

As big strides were being made in many science fields in the 1970s and 80s, faster computation for solving problems in molecular biology, semiconductor technology, aeronautics, particle physics, etc., was at the forefront of research. Parallel and super-co ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Practical Compilation of Quantum Programs

Bruno Schmitt Antunes

It's been a little more than 40 years since researchers first suggested exploiting quantum physics to build more powerful computers. During this time, we have seen the development of many quantum algorithms and significant technological advances to make th ...

EPFL2022

This article presents the first cryogenic phase-locked loop (PLL) operating at 4.2 K. The PLL is designed for the control system of scalable quantum computers. The specifications of PLL are derived from the required control fidelity for a single-qubit oper ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

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

Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

Bruno Schmitt Antunes

We describe a family of recursive methods for the synthesis of qubit permutations on quantum computers with limited qubit connectivity. Two objectives are of importance: circuit size and depth. In each case we combine a scalable heuristic with a nonscalabl ...

ASSOC COMPUTING MACHINERY2022