Data-stationary Architecture to Execute Quantum Algorithms Classically

Simple item page
dc.creatorBurger, J. R.
dc.date2004-12-09
dc.date.accessioned2026-07-07T03:22:11Z
dc.date.available2026-07-07T03:22:11Z
dc.descriptionThis paper presents a data stationary architecture in which each word has an attached address field. Address fields massively update in parallel to record data interchanges. Words do not move until memory is read for post processing. A sea of such cells can test large-scale quantum algorithms, although other programming is possible.
dc.identifierhttps://arxiv.org/abs/cs/0412040
dc.identifierhttp://arxiv.org/abs/cs/0412040
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32494
dc.subjectHardware Architecture
dc.subjectC.1.2
dc.titleData-stationary Architecture to Execute Quantum Algorithms Classically
dc.typetext

Files

Collections

arXiv