Simulations of Shor's algorithm using matrix product states

DOI10.1007/S11128-017-1587-XzbMath1373.81155arXiv1501.07644OpenAlexW1904706595WikidataQ59423698 ScholiaQ59423698MaRDI QIDQ1674568

Peng Zhang

Publication date: 25 October 2017

Published in: Quantum Information Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Factorization (11Y05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Efficient Construction of Functional Representations for Quantum Algorithms

Uses Software

• ScaLAPACK
• QCMPI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• QCMPI: A parallel environment for quantum computing
• Massively parallel quantum computer simulator
• Colloquium: Quantum annealing and analog quantum computation
• ScaLAPACK Users' Guide
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the role of entanglement in quantum-computational speed-up

This page was built for publication: Simulations of Shor's algorithm using matrix product states