Visualizing Quantum Circuits: State Vector Difference Highlighting and the Half-Matrix

• URL: http://arxiv.org/abs/2510.00895v1
• Date: Wed, 01 Oct 2025 13:37:21 GMT
• Title: Visualizing Quantum Circuits: State Vector Difference Highlighting and the Half-Matrix
• Authors: Michael J. McGuffin, Jean-Marc Robert,
• Abstract summary: Existing graphical user interfaces for circuit simulators often show small visual summaries of the reduced state of each qubit.<n>We contribute two novel visual approaches to provide more complete information about small circuits.
• Score: 2.9520871474641486
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing graphical user interfaces for circuit simulators often show small visual summaries of the reduced state of each qubit, showing the probability, phase, purity, and/or Bloch sphere coordinates associated with each qubit. These necessarily provide an incomplete picture of the quantum state of the qubits, and can sometimes be confusing for students or newcomers to quantum computing. We contribute two novel visual approaches to provide more complete information about small circuits. First, to complement information about each qubit, we show the complete state vector, and illustrate the way that amplitudes change from layer-to-layer under the effect of different gates, by using a small set of colors, arrows, and symbols. We call this ``state vector difference highlighting'', and show how it elucidates the effect of Hadamard, X, Y, Z, S, T, Phase, and SWAP gates, where each gate may have an arbitrary combination of control and anticontrol qubits. Second, we display pairwise information about qubits (such as concurrence and correlation) in a triangular ``half-matrix'' visualization. Our open source software implementation, called MuqcsCraft, is available as a live online demonstration that runs in a web browser without installing any additional software, allowing a user to define a circuit through drag-and-drop actions, and then simulate and visualize it.

Related papers

• state-o-gram --A Novel 2D Visualization for Quantum States [0.0]
  This paper introduces state-o-gram, a novel 2D visualization approach designed to intuitively represent quantum states for an arbitrary number of qubits.<n>We detail its design principles, visual elements, and application to multi-qubit systems, aiming to provide a scalable and intuitive tool for quantum state analysis.
  arXiv  Detail & Related papers  (2025-08-25T18:30:33Z)
• Realization and Calibration of Continuously Parameterized Two-Qubit Gates on a Trapped-Ion Quantum Processor [0.0]
  Continuously parameterized two-qubit gates are a key feature of state-of-the-art trapped-ion quantum processors.<n>We show how to implement these gates on the Quantum Scientific Computing Open User Testbed (QSCOUT), a low-level trapped-ion processor.
  arXiv  Detail & Related papers  (2025-04-08T17:59:10Z)
• Measurement-Based Quantum Compiling via Gauge Invariance [1.1510009152620668]
  We introduce a new paradigm for quantum compiling directly converting any quantum circuit to a class of graph states, independently from its size. The graph state can be rebuilt from the circuit and the input by employing a set of graphical rules similar to the Feynman's ones. Compared to Measurement Calculus, the ancillary qubits are reduced by 50% on QFT and 75% on QAOA.
  arXiv  Detail & Related papers  (2024-11-19T13:09:49Z)
• Quantum-state texture and gate identification [55.2480439325792]
  We show that texture of an arbitrary quantum state is adequately described by an easily computable monotone. It is shown that textures are useful in the characterization of unknown quantum gates in universal circuit layers.
  arXiv  Detail & Related papers  (2024-09-10T13:11:34Z)
• Full Characterization of the Depth Overhead for Quantum Circuit Compilation with Arbitrary Qubit Connectivity Constraint [5.755460769073285]
  In some physical implementations of quantum computers, 2-qubit operations can be applied only on certain pairs of qubits.<n>In this paper, we fully characterize the depth overhead by the routing number of the underlying constraint graph.
  arXiv  Detail & Related papers  (2024-02-04T08:29:41Z)
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data [0.0]
  We show that classical data with a quickly decaying Fourier spectrum can be well-approximated by states with a small Schmidt rank. These approximated states can, in turn, be prepared on a quantum computer with a linear number of nearest-neighbor two-qubit gates. We also consider different variational circuit ans"atze and demonstrate numerically that one-dimensional sequential circuits achieve the same compression quality as more powerful ans"atze.
  arXiv  Detail & Related papers  (2023-11-13T19:00:33Z)
• Graph test of controllability in qubit arrays: A systematic way to determine the minimum number of external controls [62.997667081978825]
  We show how to leverage an alternative approach, based on a graph representation of the Hamiltonian, to determine controllability of arrays of coupled qubits. We find that the number of controls can be reduced from five to one for complex qubit-qubit couplings.
  arXiv  Detail & Related papers  (2022-12-09T12:59:44Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Dual Vision Transformer [114.1062057736447]
  We propose a novel Transformer architecture that aims to mitigate the cost issue, named Dual Vision Transformer (Dual-ViT) The new architecture incorporates a critical semantic pathway that can more efficiently compress token vectors into global semantics with reduced order of complexity. We empirically demonstrate that Dual-ViT provides superior accuracy than SOTA Transformer architectures with reduced training complexity.
  arXiv  Detail & Related papers  (2022-07-11T16:03:44Z)
• A quantum processor based on coherent transport of entangled atom arrays [44.62475518267084]
  We show a quantum processor with dynamic, nonlocal connectivity, in which entangled qubits are coherently transported in a highly parallel manner. We use this architecture to realize programmable generation of entangled graph states such as cluster states and a 7-qubit Steane code state.
  arXiv  Detail & Related papers  (2021-12-07T19:00:00Z)
• Adaptive Context-Aware Multi-Modal Network for Depth Completion [107.15344488719322]
  We propose to adopt the graph propagation to capture the observed spatial contexts. We then apply the attention mechanism on the propagation, which encourages the network to model the contextual information adaptively. Finally, we introduce the symmetric gated fusion strategy to exploit the extracted multi-modal features effectively. Our model, named Adaptive Context-Aware Multi-Modal Network (ACMNet), achieves the state-of-the-art performance on two benchmarks.
  arXiv  Detail & Related papers  (2020-08-25T06:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.