Efficient Construction of Functional Representations for Quantum Algorithms
From MaRDI portal
Publication:5162612
DOI10.1007/978-3-030-79837-6_14OpenAlexW3175918563MaRDI QIDQ5162612
Lukas Burgholzer, Rudy Raymond, Robert Wille, Indranil Sen 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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum computer simulation using the CUDA programming model
- Simulations of Shor's algorithm using matrix product states
- Quantum Computation and Quantum Information
- Simulating Quantum Computation by Contracting Tensor Networks
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum speedup of Monte Carlo methods
This page was built for publication: Efficient Construction of Functional Representations for Quantum Algorithms