Certifying Quantum States with Uniform Measurements

• URL: http://arxiv.org/abs/2508.09259v1
• Date: Tue, 12 Aug 2025 18:00:58 GMT
• Title: Certifying Quantum States with Uniform Measurements
• Authors: Liang Mao, Yifei Wang, Yingfei Gu, Chengshu Li,
• Abstract summary: Qubit-resolved operations and measurements are required for most current quantum information processing schemes.<n>A more resource-efficient alternative is uniform measurement, where a site-independent rotation of qubits is performed before measuring.<n>We show that uniform measurements can certify certain graph states, a family of highly entangled and broadly useful quantum states.
• Score: 14.157898052067532
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Qubit-resolved operations and measurements are required for most current quantum information processing schemes. However, these operations can be experimentally costly due to the need for local addressing, demanding significant classical control. A more resource-efficient alternative to extract information is uniform measurement, where a site-independent rotation of qubits is performed before measuring in the computational basis. This operation can be performed in parallel, or globally, in atom- and ion-based platforms, reducing resource cost and increasing fidelity. In this work, we initiate the exploration of the utility of this operation in quantum information processing. In particular, we demonstrate that uniform measurements can certify certain graph states, a family of highly entangled and broadly useful quantum states. We provide a sample-efficient certification algorithm with a proved performance guarantee, together with an experimental scheme based on analog-mode Rydberg atom arrays. Uniform measurements, therefore, allow direct and efficient characterization of quantum states on quantum platforms in a hitherto unexplored manner.

Related papers

• Measuring entanglement without local addressing in quantum many-body simulators via spiral quantum state tomography [0.0]
  Quantum state tomography serves as a key tool for identifying quantum states generated in quantum computers and simulators.<n>Here, we present a tomography scheme that scales far more efficiently and, remarkably, eliminates the need for local addressing of single constituents.<n>The results of the numerical simulations demonstrate a high degree of tomographic efficiency and accuracy.
  arXiv  Detail & Related papers  (2024-11-25T17:37:29Z)
• Bounding the Sample Fluctuation for Pure States Certification with Local Random Measurement [4.923287660970805]
  Recent advancements in randomized measurement techniques have provided fresh insights in this area. We investigate the fundamental properties of schemes that certify pure quantum states through random local Haar measurements. Our results unveil the intrinsic interplay between operator complexity and the efficiency of quantum algorithms, serving as an obstacle to local certification of pure states with long-range entanglement.
  arXiv  Detail & Related papers  (2024-10-22T02:26:44Z)
• 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)
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers [37.69303106863453]
  We propose a state preparation method based on coupled cluster (CC) theory, which is a pillar of quantum chemistry on classical computers. Our approach leads to a reduction of the classical computation overhead, and the number of CNOT and T gates by 28% and 57% on average.
  arXiv  Detail & Related papers  (2024-06-17T14:10:10Z)
• 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)
• Power of quantum measurement in simulating unphysical operations [9.934365085171978]
  We show that using quantum measurement instead leads to lower simulation costs for general Hermitian-preserving maps.<n>Our work paves the way for more efficient sampling techniques and has the potential to be extended to more quantum information processing scenarios.
  arXiv  Detail & Related papers  (2023-09-18T17:39:38Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• 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)
• The randomized measurement toolbox [3.2095357952052854]
  We review recently developed protocols for probing the properties of complex many-qubit systems. In all these protocols, a quantum state is repeatedly prepared and measured in a randomly chosen basis. We discuss a range of use cases that have already been realized in quantum devices.
  arXiv  Detail & Related papers  (2022-03-21T22:33:18Z)
• Dynamical learning of a photonics quantum-state engineering process [48.7576911714538]
  Experimentally engineering high-dimensional quantum states is a crucial task for several quantum information protocols. We implement an automated adaptive optimization protocol to engineer photonic Orbital Angular Momentum (OAM) states. This approach represents a powerful tool for automated optimizations of noisy experimental tasks for quantum information protocols and technologies.
  arXiv  Detail & Related papers  (2022-01-14T19:24:31Z)
• 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)

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.