Contractive Unitary and Classical Shadow Tomography

• URL: http://arxiv.org/abs/2412.01850v1
• Date: Thu, 28 Nov 2024 18:59:12 GMT
• Title: Contractive Unitary and Classical Shadow Tomography
• Authors: Yadong Wu, Ce Wang, Juan Yao, Hui Zhai, Yi-Zhuang You, Pengfei Zhang,
• Abstract summary: Full quantum state tomography requires an exponential number of measurements in system size. This work shows that a random-deterministic hybridized protocol can be more efficient than fully random measurements.
• Score: 8.406921897932131
• License:
• Abstract: The rapid development of quantum technology demands efficient characterization of complex quantum many-body states. However, full quantum state tomography requires an exponential number of measurements in system size, preventing its practical use in large-scale quantum devices. A major recent breakthrough in this direction, called classical shadow tomography, significantly reduces the sample complexity, the number of samples needed to estimate properties of a state, by implementing random Clifford rotations before measurements. Despite many recent efforts, reducing the sample complexity below $\mathbf{2^k}$ for extracting any non-successive local operators with a size $\sim \mathbf{k}$ remains a challenge. In this work, we achieve a significantly smaller sample complexity of $\mathbf{\sim 1.8^k}$ using a protocol that hybridizes locally random and globally deterministic unitary operations. The key insight is the discovery of a deterministic global unitary, termed as \textit{contractive unitary}, which is more efficient in reducing the operator size to enhance tomography efficiency. The contractive unitary perfectly matches the advantages of the atom array quantum computation platform and is readily realized in the atom array quantum processor. More importantly, it highlights a new strategy in classical shadow tomography, demonstrating that a random-deterministic hybridized protocol can be more efficient than fully random measurements.

Related papers

• Sample Optimal and Memory Efficient Quantum State Tomography [6.815730801645785]
  We propose and analyse a quantum state tomography algorithm which retains sample-optimality but is also memory-efficient. Our work is built on a form of unitary Schur sampling and only requires streaming access to the samples.
  arXiv  Detail & Related papers  (2024-10-21T17:24:08Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Holographic Classical Shadow Tomography [1.9818805908789396]
  We introduce "holographic shadows", a new class of randomized measurement schemes for classical shadow tomography. "holographic shadows" achieves the optimal scaling of sample complexity for learning geometrically local Pauli operators at any length scale.
  arXiv  Detail & Related papers  (2024-06-17T17:40:59Z)
• Quantum Tensor Product Decomposition from Choi State Tomography [0.0]
  We present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor product decomposition of a unitary. This quantum algorithm may be used to make predictions about operator non-locality, effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries.
  arXiv  Detail & Related papers  (2024-02-07T16:36:47Z)
• Operator relaxation and the optimal depth of classical shadows [0.0]
  We study the sample complexity of learning the expectation value of Pauli operators via shallow shadows'' We show that the shadow norm is expressed in terms of properties of the Heisenberg time evolution of operators under the randomizing circuit.
  arXiv  Detail & Related papers  (2022-12-22T18:46:46Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Quantum Sparse Coding [5.130440339897477]
  We develop a quantum-inspired algorithm for sparse coding. The emergence of quantum computers and Ising machines can potentially lead to more accurate estimations. We conduct numerical experiments with simulated data on Lightr's quantum-inspired digital platform.
  arXiv  Detail & Related papers  (2022-09-08T13:00:30Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• 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)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30: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.