@article{Evans_2021, title={Quick Quantum Circuit Simulation}, volume={3}, url={https://journals.bilpubgroup.com/index.php/jcsr/article/view/3567}, DOI={10.30564/jcsr.v3i4.3567}, abstractNote={<p>Quick Quantum Circuit Simulation (QQCS) is a software system for computing the result of a quantum circuit using a notation that derives directly from the circuit, expressed in a single input line. Quantum circuits begin with an initial quantum state of one or more qubits, which are the quantum analog to classical bits. The initial state is modified by a sequence of quantum gates, quantum machine language instructions, to get the final state. Measurements are made of the final state and displayed as a classical binary result. Measurements are postponed to the end of the circuit because a quantum state collapses when measured and produces probabilistic results, a consequence of quantum uncertainty. A circuit may be run many times on a quantum computer to refine the probabilistic result. Mathematically, quantum states are 2<sup>n</sup> -dimensional vectors over the complex number field, where n is the number of qubits. A gate is a 2<sup>n</sup> ×2<sup>n</sup> unitary matrix of complex values. Matrix multiplication models the application of a gate to a quantum state. QQCS is a mathematical rendering of each step of a quantum algorithm represented as a circuit, and as such, can present a trace of the quantum state of the circuit after each gate, compute gate equivalents for each circuit step, and perform measurements at any point in the circuit without state collapse. Output displays are in vector coefficients or Dirac bra-ket notation. It is an easy-to-use educational tool for students new to quantum computing.</p>}, number={4}, journal={Journal of Computer Science Research}, author={Evans, Daniel}, year={2021}, month={Oct.}, pages={9–19} }