Quantum Computing References
Primary papers, specifications, official project documentation, and implementation entry points.
- Farhi, Goldstone & Gutmann (2014), A Quantum Approximate Optimization Algorithm. The implemented fixed p=1 grid is described separately in our methodology.
- Lucas (2014), Ising formulations of many NP problems. Context for binary penalties and Ising formulations; our exact coefficient convention is documented in the mapping.
- Cross et al. (2017), Open Quantum Assembly Language; current OpenQASM specification. AutomationGlance exports a 2.0 subset, not all current-language features.
- Preskill (2018), Quantum Computing in the NISQ era and beyond. NISQ refers to noisy intermediate-scale quantum devices; this ideal simulator does not model their noise.
- IBM Quantum Learning: quantum circuits and Statevector reference for the circuit model and statevector representation.
- The Max-Cut objective here is the unweighted sum of edges crossing a binary partition. The QAOA paper above treats this objective. See our enumerated example.
- Official ecosystem references are linked from Where AutomationGlance Fits.
Implementation entry points
The repository is the source for product-specific behavior. At review baseline 3fb7ce24194cf19addcfc387fc80a9674f1f9582, inspect src/QuantumPlayground: CircuitParserService, QuantumSimulatorService, SimulationController, BinaryQuadraticModel, QaoaCircuitBuilderService, QaoaParameterOptimizerService, QuboQaoaService, the three classical solvers and scale estimators. Browser export lives in frontend/assets/qasm.js. Repository regression tests accompany this documentation update.