scientific article; zbMATH DE number 7559364

DOI10.4230/LIPICS.TQC.2019.3MaRDI QIDQ5089148FDOQ5089148

Authors: Andrew M. Childs, Eddie Schoute, Cem Ünsal 

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1902.09102

Title of this publication is not available (Why is that?)

Recommendations

• Transformation rules for CNOT-based quantum circuits and their applications
• Quantum circuits synthesis using Householder transformations
• Quantum circuit for the fast Fourier transform
• Quantum gates and circuits
• Efficient quantum circuits for Schur and Clebsch-Gordan transforms
• Efficient circuits for exact-universal computation with qudits
• The quantum Schur and Clebsch-Gordan transforms: I. Efficient qudit circuits
• Quantum circuit physical design methodology with emphasis on physical synthesis
• Quantum circuit design for accurate simulation of qudit channels
• Quantum Circuit Simulation

zbMATH Keywords

quantum circuitquantum architecturescircuit mapping

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Title not available (Why is that?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Title not available (Why is that?)
• The generalized hierarchical product of graphs
• Sorting in \(c \log n\) parallel steps
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Routing Permutations on Graphs via Matchings
• Implementation of Shor's algorithm on a linear nearest neighbour qubit array
• Sorting networks on restricted topologies
• Toward the first quantum simulation with quantum speedup
• New results on routing via matchings on graphs
• Swapping labeled tokens on graphs
• Approximation and hardness of token swapping
• Efficient distributed quantum computing
• Complexity of token swapping and its variants
• Optimal Bounds for Matching Routing on Trees
• Title not available (Why is that?)
• Computation at a distance
• Optimal Quantum Circuits for Nearest-Neighbor Architectures

Cited In (5)

• Exploring \textit{ab initio} machine synthesis of quantum circuits
• The complexity of quantum circuit mapping with fixed parameters
• Improving quantum computation by optimized qubit routing
• Title not available (Why is that?)
• Transformation rules for CNOT-based quantum circuits and their applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089148)