Neural Network Learning of One-Bit Protocols for Qubit Measurement Simulation

• URL: http://arxiv.org/abs/2607.23645v1
• Date: Sun, 26 Jul 2026 13:25:50 GMT
• Title: Neural Network Learning of One-Bit Protocols for Qubit Measurement Simulation
• Abstract summary: We show that a single bit can achieve high average accuracy for specific measurement families.<n>We derive an analytical protocol that is extremely accurate for finite information- ally complete symmetric configurations.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Communication complexity provides a natural framework for quantifying the classical resources required to reproduce quantum statistics. In the qubit prepare-and-measure scenario, two classical bits have been shown to be necessary and sufficient to simulate arbitrary qubit states and arbi- trary quantum measurements exactly. However, this result does not exclude the possibility that restricted families of measurements may admit accurate 1-bit classical approximations. We use a neural network procedure to demonstrate that a single bit can achieve high average accuracy for specific measurement families. A performance analysis of our neural network reveals that symmet- ric measurements with uniformly weighted elements, such as those forming regular polyhedra, are particularly amenable to this restricted communication. By analyzing the patterns learned by the neural network, we derive an analytical protocol that is extremely accurate for finite information- ally complete symmetric configurations and becomes exact in the limit of a continuous isotropic measurement.

Related papers

• Near-optimal quantum metrology with few-qubit measurements [2.1171784356348486]
  We introduce a family of protocols that use only few-qubit measurements, thereby significantly reducing the required resources.<n>For arbitrary pure states, one of our protocols approaches the quantum Cramér-Rao bound up to an overhead in sample complexity that scales linearly with the number of qubits.<n>Our results build on recent advances in quantum state certification protocols with few-qubit measurements.
  arXiv  Detail & Related papers  (2026-08-03T02:46:52Z)
• Comparing Classical Simulation and Sample-Based Learning of Quantum Systems: Learning the Hardness of Quantum Systems from Samples [41.99844472131922]
  We investigate the relationship between two distinct classical approaches to quantum systems.<n>We use a fixed deep energy-based generative model trained on measurement samples from controlled families of quantum states.
  arXiv  Detail & Related papers  (2026-05-27T18:44:36Z)
• Temporal Framework for Causality-Preserving Scheduling of Measurements in Quantum Networks [37.29183352005633]
  quantum protocols rely on classical feedforward information to process measurement outcomes.<n> heterogeneous hardware and uncertain local timing can make causal order of measurements ambiguous.<n>We propose a time-division architecture for quantum networks in which nodes perform measurements in pre-assigned slots.
  arXiv  Detail & Related papers  (2026-02-12T22:36:30Z)
• 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)
• 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)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Inferring Quantum Network Topology using Local Measurements [3.549868541921029]
  We propose an efficient protocol for distinguishing and inferring the topology of a quantum network. We show that the protocol can be entirely robust to noise and can be implemented via quantum variational optimization.
  arXiv  Detail & Related papers  (2022-12-15T17:36:12Z)
• Neural network enhanced measurement efficiency for molecular groundstates [63.36515347329037]
  We adapt common neural network models to learn complex groundstate wavefunctions for several molecular qubit Hamiltonians. We find that using a neural network model provides a robust improvement over using single-copy measurement outcomes alone to reconstruct observables.
  arXiv  Detail & Related papers  (2022-06-30T17:45:05Z)
• Deep learning of quantum entanglement from incomplete measurements [0.2493740042317776]
  We demonstrate that by employing neural networks we can quantify the degree of entanglement without needing to know the full description of the quantum state. Our method allows for direct quantification of the quantum correlations using an incomplete set of local measurements. We derive a method based on a convolutional network input that can accept data from various measurement scenarios and perform, to some extent, independently of the measurement device.
  arXiv  Detail & Related papers  (2022-05-03T12:55:39Z)
• Entanglement quantification from collective measurements processed by machine learning [0.0]
  Instead of analytical formulae, we employ artificial neural networks to predict the amount of entanglement in a quantum state. For the purpose of our research, we consider general two-qubit states and their negativity as entanglement quantifier.
  arXiv  Detail & Related papers  (2022-03-03T10:03:57Z)
• A Quantitative Geometric Approach to Neural Network Smoothness [44.31859964161672]
  We provide a unified theoretical framework, a quantitative geometric approach, to address the Lipschitz constant estimation. We implement the algorithms induced from this quantitative geometric approach in a tool GeoLIP.
  arXiv  Detail & Related papers  (2022-03-02T16:13:33Z)
• Cluster-Promoting Quantization with Bit-Drop for Minimizing Network Quantization Loss [61.26793005355441]
  Cluster-Promoting Quantization (CPQ) finds the optimal quantization grids for neural networks. DropBits is a new bit-drop technique that revises the standard dropout regularization to randomly drop bits instead of neurons. We experimentally validate our method on various benchmark datasets and network architectures.
  arXiv  Detail & Related papers  (2021-09-05T15:15:07Z)
• Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers [50.85524803885483]
  This work proposes a formal definition of statistically meaningful (SM) approximation which requires the approximating network to exhibit good statistical learnability. We study SM approximation for two function classes: circuits and Turing machines.
  arXiv  Detail & Related papers  (2021-07-28T04:28:55Z)

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.