Efficient Construction of Functional Representations for Quantum Algorithms

DOI10.1007/978-3-030-79837-6_14MaRDI QIDQ5162612zbMATH OpenOpenAlexFDO

Authors Lukas Burgholzer, Rudy Raymond, Robert Wille, Indranil Gupta

Publication date 3 November 2021

Published in Reversible Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Cites work

• Fast equivalence-checking for quantum circuits
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum computation and quantum information. 10th anniversary edition
• Quantum computer simulation using the CUDA programming model
• Quantum speedup of Monte Carlo methods
• Simulating Quantum Computation by Contracting Tensor Networks
• Simulations of Shor's algorithm using matrix product states

Cited in

(5)

• Quantum algorithm to solve function inversion with time-space trade-off
• Efficient quantum algorithm for the parity problem of a certain function
• Efficient algebraic representation of quantum circuits
• Efficient quantum algorithms to construct arbitrary Dicke states
• Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams

This page was built for publication: Efficient Construction of Functional Representations for Quantum Algorithms

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