Data-stationary Architecture to Execute Quantum Algorithms Classically
<|reference_start|>Data-stationary Architecture to Execute Quantum Algorithms Classically: This 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.<|reference_end|>
@article{burger2004data-stationary,
    title={Data-stationary Architecture to Execute Quantum Algorithms Classically},
    author={J. R. Burger},
    journal={arXiv preprint arXiv:cs/0412040},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0412040},
    primaryClass={cs.AR}
}