state-o-gram --A Novel 2D Visualization for Quantum States

• URL: http://arxiv.org/abs/2508.18390v1
• Date: Mon, 25 Aug 2025 18:30:33 GMT
• Title: state-o-gram --A Novel 2D Visualization for Quantum States
• Authors: Fritz Schinkel,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing is rapidly gaining popularity, necessitating intuitive visualization tools for complex quantum states. While the Bloch Sphere effectively visualizes single-qubit states, it fundamentally lacks scalability for multi-qubit systems. Existing multi-qubit visualization attempts, such as VENUS, have shown promise but often face limitations in scalability beyond a few qubits. This paper introduces state-o-gram, a novel 2D visualization approach designed to intuitively represent quantum states for an arbitrary number of qubits. state-o-gram effectively visualizes probability amplitudes and phase angles in a unified 2D framework, addressing the limitations of prior art. 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. We evaluate the applicability by visualizing the states throughout the Deutsch-Josza algorithm.

Related papers

• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Digital quantum simulation of squeezed states via enhanced bosonic encoding in a superconducting quantum processor [33.56337116542515]
  We present a fully digital approach for simulating single-mode squeezed states on a superconducting quantum processor.<n>By mapping up to 2n photonic Fock states onto n qubits, our framework leverages Gray-code-based encodings to reduce gate overhead.<n>We further optimize resource usage by restricting the simulation on Fock states with even number of photons only.
  arXiv  Detail & Related papers  (2025-05-16T06:02:25Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Mixed-Dimensional Qudit State Preparation Using Edge-Weighted Decision Diagrams [3.393749500700096]
  Quantum computers have the potential to solve intractable problems. One key element to exploiting this potential is the capability to efficiently prepare quantum states for multi-valued, or qudit, systems. In this paper, we investigate quantum state preparation with a focus on mixed-dimensional systems.
  arXiv  Detail & Related papers  (2024-06-05T18:00:01Z)
• Benchmarking Multipartite Entanglement Generation with Graph States [0.0]
  We experimentally verify that a fully bipartite entangled state can be prepared on a 127-qubit IBM Quantum superconducting QPU. We also find that genuine multipartite entanglement can be detected for states of up to 23 qubits with quantum readout error mitigation.
  arXiv  Detail & Related papers  (2024-02-01T16:55:07Z)
• Generating scalable graph states in an atom-nanophotonic interface [0.0]
  scalable graph states are essential for measurement-based quantum computation and many entanglement-assisted applications in quantum technologies. Here we propose to prepare high-fidelity and scalable graph states in one and two dimensions, which can be tailored in an atom-nanophotonic cavity. An analysis of state fidelity is also presented, and the state preparation probability can be optimized via multiqubit state carvings and sequential single-photon probes.
  arXiv  Detail & Related papers  (2023-10-06T03:33:32Z)
• Visualizing Entanglement in multi-Qubit Systems [1.7788938361329507]
  We utilize the dimensional circle notation as a representation of ensembles of few qubits. We show that the mathematical conditions for separability lead to symmetry conditions of the quantum state visualized.
  arXiv  Detail & Related papers  (2023-05-12T16:41:59Z)
• VENUS: A Geometrical Representation for Quantum State Visualization [14.373238457656237]
  VENUS is a novel visualization for quantum state representation. We show that VENUS can effectively facilitate the exploration of quantum states for the single qubit and two qubits.
  arXiv  Detail & Related papers  (2023-03-15T04:56:23Z)
• Scalable approach to many-body localization via quantum data [69.3939291118954]
  Many-body localization is a notoriously difficult phenomenon from quantum many-body physics. We propose a flexible neural network based learning approach that circumvents any computationally expensive step. Our approach can be applied to large-scale quantum experiments to provide new insights into quantum many-body physics.
  arXiv  Detail & Related papers  (2022-02-17T19:00:09Z)
• 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)
• Quantum verification and estimation with few copies [63.669642197519934]
  The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
  arXiv  Detail & Related papers  (2021-09-08T18:20:07Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Entanglement transfer, accumulation and retrieval via quantum-walk-based qubit-qudit dynamics [50.591267188664666]
  Generation and control of quantum correlations in high-dimensional systems is a major challenge in the present landscape of quantum technologies. We propose a protocol that is able to attain entangled states of $d$-dimensional systems through a quantum-walk-based it transfer & accumulate mechanism. In particular, we illustrate a possible photonic implementation where the information is encoded in the orbital angular momentum and polarization degrees of freedom of single photons.
  arXiv  Detail & Related papers  (2020-10-14T14:33:34Z)

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.