Publication

Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

Bruno Schmitt Antunes
2022
Conference paper

Abstract

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 nonscalable, yet exact, synthesis.

Official source

https://infoscience.epfl.ch/record/304840?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Optimizing Quantum Circuit Synthesis for Permutations Using Recursion

Graph Chatbot

Chat with Graph Search

Quantum Error Correction and Simulation in Open Bosonic Systems

Scalable Quantum Algorithms for Noisy Quantum Computers

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

Quantum Error Correction and Simulation in Open Bosonic Systems

Scalable Quantum Algorithms for Noisy Quantum Computers

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