Circuit optimization of qubit IC-POVMs for shadow estimation

• URL: http://arxiv.org/abs/2409.05676v1
• Date: Mon, 9 Sep 2024 14:42:47 GMT
• Title: Circuit optimization of qubit IC-POVMs for shadow estimation
• Authors: Zhou You, Qing Liu, You Zhou,
• Abstract summary: POVM-based shadow estimation has been integrated to realize real-time single-setting shadow estimation. We show that any single-qubit minimal IC-POVM can be implemented using at most 2 CNOT gates, while an SIC-POVM can be implemented with only 1 CNOT gate. Our work paves the way for the practical applications of qubit IC-POVMs on quantum platforms.
• Score: 3.88278764198609
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Extracting information from quantum systems is crucial in quantum physics and information processing. Methods based on randomized measurements, like shadow estimation, show advantages in effectively achieving such tasks. However, randomized measurements require the application of random unitary evolution, which unavoidably necessitates frequent adjustments to the experimental setup or circuit parameters, posing challenges for practical implementations. To address these limitations, positive operator-valued measurements (POVMs) have been integrated to realize real-time single-setting shadow estimation. In this work, we advance the POVM-based shadow estimation by reducing the CNOT gate count for the implementation circuits of informationally complete POVMs (IC-POVMs), in particular, the symmetric IC-POVMs (SIC-POVMs), through the dimension dilation framework. We show that any single-qubit minimal IC-POVM can be implemented using at most 2 CNOT gates, while an SIC-POVM can be implemented with only 1 CNOT gate. In particular, we provide a concise form of the compilation circuit of any SIC-POVM along with an efficient algorithm for the determination of gate parameters. Moreover, we apply the optimized circuit compilation to shadow estimation, showcasing its noise-resilient performance and highlighting the flexibility in compiling various SIC-POVMs. Our work paves the way for the practical applications of qubit IC-POVMs on quantum platforms.

Related papers

• Block encoding by signal processing [0.0]
  We demonstrate that QSP-based techniques, such as Quantum Singular Value Transformation (QSVT) and Quantum Eigenvalue Transformation for Unitary Matrices (QETU) can themselves be efficiently utilized for BE implementation. We present several examples of using QSVT and QETU algorithms, along with their combinations, to block encode Hamiltonians for lattice bosons. We find that, while using QSVT for BE results in the best gate count scaling with the number of qubits per site, LOVE-LCU outperforms all other methods for operators acting on up to $lesssim11$ qubits.
  arXiv  Detail & Related papers  (2024-08-29T18:00:02Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Coarse-grained quantum state tomography with optimal POVM construction [2.985603723386298]
  We introduce a novel approach to reconstruct the target density matrix from a comprehensive set of Positive Operator-Valued Measures (POVM) We improve the robustness and stability of CG state tomography (QST) by optimizing the POVM set to achieve a generalized symmetric informationally complete (GSIC) POVM. We discuss a more efficient construction of N-qubit CG-QST without exponential increases in two-qubit or circuit depth per measurement.
  arXiv  Detail & Related papers  (2024-04-09T13:11:27Z)
• Mapping quantum circuits to shallow-depth measurement patterns based on graph states [0.0]
  We create a hybrid simulation technique for measurement-based quantum computing. We show that groups of fully commuting operators can be implemented using fully-parallel, i.e., non-adaptive, measurements. We discuss how such circuits can be implemented in constant quantum depths by employing quantum teleportation.
  arXiv  Detail & Related papers  (2023-11-27T19:00:00Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Adaptive POVM implementations and measurement error mitigation strategies for near-term quantum devices [0.0]
  We present adaptive measurement techniques tailored for variational quantum algorithms on near-term small and noisy devices. Our numerical simulations clearly indicate that the presented strategies can significantly reduce the number of needed shots to achieve chemical accuracy in variational quantum eigensolvers.
  arXiv  Detail & Related papers  (2022-08-16T16:05:40Z)
• Task-Oriented Sensing, Computation, and Communication Integration for Multi-Device Edge AI [108.08079323459822]
  This paper studies a new multi-intelligent edge artificial-latency (AI) system, which jointly exploits the AI model split inference and integrated sensing and communication (ISAC) We measure the inference accuracy by adopting an approximate but tractable metric, namely discriminant gain.
  arXiv  Detail & Related papers  (2022-07-03T06:57:07Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Ancilla-free implementation of generalized measurements for qubits embedded in a qudit space [1.4680035572775534]
  We show how to implement a general class of IC-POVMs without ancilla qubits. We exploit the higher-dimensional Hilbert space of a qudit in which qubits are often encoded. We develop the required control pulse sequences and numerically establish their feasibility for superconducting transmon qubits.
  arXiv  Detail & Related papers  (2022-03-14T17:59:59Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.