Minimum measurements quantum protocol for band structure calculation

• URL: http://arxiv.org/abs/2511.04389v1
• Date: Thu, 06 Nov 2025 14:18:10 GMT
• Title: Minimum measurements quantum protocol for band structure calculation
• Authors: Michal Krejčí, Lucie Krejčí, Ijaz Ahamed Mohammad, Martin Plesch, Martin Friák,
• Abstract summary: We propose a protocol that maximally reduces the number of measurement settings to just three, independent of the number of qubits.<n>This makes it one of the few known protocols that do not scale with qubit number.<n>We demonstrate its performance on two systems, namely a two-dimensional CuO$$ square lattice (3bits) and bilayer graphene (4bits)
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Protocols for quantum measurement are an essential part of quantum computing. Measurements are no longer confined to the final step of computation but are increasingly embedded within quantum circuits as integral components of noise-resilient algorithms. However, each observable typically requires a distinct measurement basis, often demanding a different circuit configuration. As the number of such configurations typically grows with the number of qubits, different measurement configurations constitute a major bottleneck. Focusing on electronic structure calculations in crystalline systems, we propose a measurement protocol that maximally reduces the number of measurement settings to just three, independent of the number of qubits. This makes it one of the few known protocols that do not scale with qubit number. In particular, we derive the measurement protocol from the symmetries of tight-binding (TB) Hamiltonians and implement it within the Variational Quantum Deflation (VQD) algorithm. We demonstrate its performance on two systems, namely a two-dimensional CuO$_2$ square lattice (3 qubits) and bilayer graphene (4 qubits). The protocol can be generalized to more complex many-body Hamiltonians with high symmetry, providing a potential path toward future demonstrations of quantum advantage.

Related papers

• Roadmap to fault tolerant quantum computation using topological qubit arrays [36.987470905062736]
  We describe a device roadmap towards a fault-tolerant quantum computing architecture based on noise-resilient, topologically protected Majorana-based qubits.<n>Our roadmap encompasses four generations of devices: a single-qubit device that enables a measurement-based qubit benchmarking protocol; a two-qubit device that uses measurement-based braiding to perform single-qubit Clifford operations; and an eight-qubit device that can be used to show an improvement of a two-qubit operation when performed on logical qubits.
  arXiv  Detail & Related papers  (2025-02-17T19:00:10Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Single-Round Proofs of Quantumness from Knowledge Assumptions [41.94295877935867]
  A proof of quantumness is an efficiently verifiable interactive test that an efficient quantum computer can pass. Existing single-round protocols require large quantum circuits, whereas multi-round ones use smaller circuits but require experimentally challenging mid-circuit measurements. We construct efficient single-round proofs of quantumness based on existing knowledge assumptions.
  arXiv  Detail & Related papers  (2024-05-24T17:33:10Z)
• Certifying almost all quantum states with few single-qubit measurements [0.9558392439655012]
  We show that almost all n-qubit target states can be certified from only O(n2) single-qubit measurements. We show that such verified representations can be used to efficiently predict highly non-local properties.
  arXiv  Detail & Related papers  (2024-04-10T18:21:11Z)
• Utilizing small quantum computers for machine learning and ground state energy approximation [0.0]
  Quantum circuit partitioning (QCP) is a hybrid quantum-classical approach that aims to simulate large quantum systems on smaller quantum computers. We propose a QCP strategy to measure an observable on a large quantum system by utilizing several quantum systems of smaller size.
  arXiv  Detail & Related papers  (2024-03-21T13:56:32Z)
• Instantaneous nonlocal quantum computation and circuit depth reduction [7.148511452018054]
  Two-party quantum computation is a computation process with bipartite input and output, in which there are initial shared entanglement. In the first part, we show that a particular simplified subprocedure, known as a garden-hose gadget, cannot significantly reduce the entanglement cost. In the second part, we show that any unitary circuit consisting of layers of Clifford gates and T gates can be implemented using a circuit with measurements of depth proportional to the T-depth of the original circuit.
  arXiv  Detail & Related papers  (2023-06-15T17:57:50Z)
• Direct tomography of quantum states and processes via weak measurements of Pauli spin operators on an NMR quantum processor [3.818504253546488]
  We present an efficient weak measurement-based scheme for direct quantum state tomography (DQST) and direct quantum process tomography (DQPT) We experimentally implement these weak measurement-based DQST and DQPT protocols and use them to accurately characterize several two-qubit quantum states and single-qubit quantum processes.
  arXiv  Detail & Related papers  (2023-03-13T06:40:19Z)
• Quantum advantage in temporally flat measurement-based quantum computation [0.0]
  We study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible.
  arXiv  Detail & Related papers  (2022-12-07T14:34:56Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Compact quantum kernel-based binary classifier [2.0684234025249717]
  We present the simplest quantum circuit for constructing a kernel-based binary classifier. The number of qubits is reduced by two and the number of steps is reduced linearly. Our design also provides a straightforward way to handle an imbalanced data set.
  arXiv  Detail & Related papers  (2022-02-04T14:30:53Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Programming a quantum computer with quantum instructions [39.994876450026865]
  We use a density matrixiation protocol to execute quantum instructions on quantum data. A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
  arXiv  Detail & Related papers  (2020-01-23T22:43:29Z)
• Experimental characterisation of unsharp qubit observables and sequential measurement incompatibility via quantum random access codes [0.0]
  We report an experimental implementation of unsharp qubit measurements in a sequential communication protocol. The protocol involves three parties; the first party prepares a qubit system, the second party performs operations which return a classical and quantum outcome, and the latter is measured by the third party.
  arXiv  Detail & Related papers  (2020-01-14T13:37:04Z)

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.