Quantum Computing Simulation Optimizations and Operational Errors on Various 2-qubit Multiplier Circuits

Simple item page
dc.creatorHsu, Eric
dc.date2002-08-15
dc.date.accessioned2026-07-07T06:04:47Z
dc.date.available2026-07-07T06:04:47Z
dc.descriptionSince simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates. Additionally, we use the simulator to investigate errors based on different probability distributions and to investigate the robustness of different 2-qubit multiplier circuits in the presence of operational errors.
dc.description13 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0208113
dc.identifierhttp://arxiv.org/abs/quant-ph/0208113
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90429
dc.subjectQuantum Physics
dc.titleQuantum Computing Simulation Optimizations and Operational Errors on Various 2-qubit Multiplier Circuits
dc.typetext

Files

Collections

arXiv