2022/10/03 by Greg Bowen, Simon J. Devitt, Bowen, Greg +1
Computer Science · Engineering · #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Physical sciences #Low-power high-performance VLSI design #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2210.00657
openalex publication_date 2022/10/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The quantum circuit model is the default for encoding an algorithm intended for a NISQ computer or a quantum computing simulator. A simple graph and through it, a graph state - quantum state physically manifesting an abstract graph structure - is syntactically expressive and tractable. A graph representation is well-suited for algorithms intended for a quantum computing facility founded on measurement-based quantum computing (MBQC) principles. Indeed, the process of creating an algorithm-specific graph can be efficiently realised through classical computing hardware. A graph state is a stabiliser state, which means a graph is a (quantum) intermediate representation at all points of the algorithm-specific graph process. We submit Q2Graph, a software package for designing and testing of simple graphs as algorithms for quantum computing facilities based on MQBC design principles. Q2Graph is a suitable modelling tool for NISQ computing facilities: the user is free to reason about structure or characteristics of its graph-as-algorithm without also having to account for (quantum) errors and their impact upon state.