Work

A 2D Nearest-Neighbor Quantum Architecture for Factoring

Year: 2012

Type: preprint

Abstract: We present a 2D nearest-neighbor quantum architecture for Shor’s factoring algorithm in polylogarithmic depth. Our implementation uses parallel phase estimation, constant-depth fanout and teleportation, and constant-depth carry-save modular addition. We derive asymptotic bounds on the circuit depth and width of our architecture and provide a comparison to all previous nearest-neighbor factoring implementations.

Source: arXiv (Cornell University)

Authors: Paul Pham, Krysta M. Svore

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2148089370

Cites: 20

Cited by: 6

Related to: 10