GraphStateVis: Interactive Visual Analysis of Qubit Graph States and their Stabilizer Groups
arXiv:2105.12752 · doi:10.1109/QCE52317.2021.00057
Abstract
Fathoming out quantum state space is a challenging endeavor due to its exponentially growing dimensionality. At the expense of being bound in its expressiveness, the discrete and finite subspace of graph states is easier to investigate via a pictorial framework accompanied with a theoretical toolkit from the stabilizer formalism. Analyzing hand-drawn graphs is a tedious and time-consuming task and imposes limitations to the problem sizes that can be addressed. Similarly, algorithmic studies using adjacency matrices alone lack the benefit of a visual representation of the states. We argue that applying visual analytics to investigate graph states can be advantageous. To this end, we introduce GraphStateVis, a web-based application for the visual analysis of qubit graph states and their stabilizer groups. Our tool facilitates the interactive construction of a graph through multiple components supported by linking and brushing. The user can explore graph-state-specific properties, including the Pauli-weight distribution of its stabilizer operators and noise thresholds for entanglement criteria. We propose a use case in the context of near-term quantum algorithms to illustrate the capabilities of our prototype. We provide access to GraphStateVis as an open-source project and invite the broader quantum computing and engineering communities to take advantage of this tool and further boost its development.
arXiv commentpublished version, only minor changes, 6+1 pages, 6 figures, https://github.com/graphstatevis (Source Code), https://graphstatevis.github.io/app (Deployed Version) This work has been selected as a Best Paper for the 2021 IEEE Quantum Week conference
References in corpus (26)
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- The theory of variational hybrid quantum-classical algorithms
- Measurement-based quantum computation with cluster states
- Sudden Death of Entanglement
- Multi-party entanglement in graph states
- Benchmarking an 11-qubit quantum computer
- Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
- Separable states are more disordered globally than locally
- Quantum Error Correction
- A quantum-inspired classical algorithm for recommendation systems
- Entanglement properties of multipartite entangled states under the influence of decoherence
- Quantum Hypergraph States
- Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
- Quantum Correlation Without Classical Correlations
- Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
- Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
- Characterizing multipartite entanglement without shared reference frames
- Quantum entanglement from random measurements
- Visual Analytics for Temporal Hypergraph Model Exploration
- Characterizing quantum states via sector lengths
- Maximum -body correlations do not in general imply genuine multipartite entanglement
- Propagation of generalized Pauli errors in qudit Clifford circuits
- Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices
- Some Ulam's reconstruction problems for quantum states
- Small quantum networks in the qudit stabilizer formalism