Chasing shadows with Gottesman-Kitaev-Preskill codes

• URL: http://arxiv.org/abs/2411.00235v2
• Date: Wed, 19 Mar 2025 15:54:03 GMT
• Title: Chasing shadows with Gottesman-Kitaev-Preskill codes
• Authors: Jonathan Conrad, Jens Eisert, Steven T. Flammia,
• Abstract summary: We consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman-Kitaev-Preskill (GKP) error correcting code.<n>We construct a logical shadow tomography protocol via twirling of continuous variable POVMs by displacement operators and Gaussian unitaries.<n>For photon parity measurements, logical GKP shadow tomography is equivalent to a Wigner sampling protocol.
• Score: 0.3277163122167433
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we consider the task of performing shadow tomography of a logical subsystem defined via the Gottesman-Kitaev-Preskill (GKP) error correcting code. We construct a logical shadow tomography protocol via twirling of continuous variable POVMs by displacement operators and Gaussian unitaries. In the special case of heterodyne measurement, the shadow tomography protocol yields a probabilistic decomposition of any input state into Gaussian states that simulate the encoded logical information of the input relative to a fixed GKP code and we prove bounds on the Gaussian compressibility of states in this setting. For photon parity measurements, logical GKP shadow tomography is equivalent to a Wigner sampling protocol for which we develop the appropriate sampling schemes and finally we derive a Wigner sampling scheme via random GKP codes. This protocol establishes how Wigner samples of any input state relative to a random GKP codes can be used to estimate any sufficiently bounded observable on CV space. This construction shows how a description of the physical state of the system can be reconstructed from encoded logical information relative to a random code and further highlights the power of performing idealized GKP error correction as a tomographic resource.

Related papers

• Logical channels in approximate Gottesman-Kitaev-Preskill error correction [0.0]
  The GKP encoding is a top contender among bosonic codes for fault-tolerant quantum computation. We analyze a variant of the GKP stabilizer measurement circuit using damped, approximate GKP states. We show that SB decoding is suboptimal for finite-energy GKP states.
  arXiv  Detail & Related papers  (2025-04-18T00:13:42Z)
• Projective squeezing for translation symmetric bosonic codes [0.16777183511743468]
  We introduce the textitprojective squeezing (PS) method for computing outcomes for a higher squeezing level. We numerically verify our analytical arguments and show that our protocol can mitigate the effect of photon loss.
  arXiv  Detail & Related papers  (2024-03-21T08:19:47Z)
• APRF: Anti-Aliasing Projection Representation Field for Inverse Problem in Imaging [74.9262846410559]
  Sparse-view Computed Tomography (SVCT) reconstruction is an ill-posed inverse problem in imaging. Recent works use Implicit Neural Representations (INRs) to build the coordinate-based mapping between sinograms and CT images. We propose a self-supervised SVCT reconstruction method -- Anti-Aliasing Projection Representation Field (APRF) APRF can build the continuous representation between adjacent projection views via the spatial constraints.
  arXiv  Detail & Related papers  (2023-07-11T14:04:12Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• 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)
• 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)
• Compressive gate set tomography [1.3406858660972554]
  Gate set tomography is a characterization approach that simultaneously and self-consistently extracts a tomographic description of the implementation of an entire set of quantum gates. We show that low-rank approximations of gate sets can be obtained from significantly fewer gate sequences. We also demonstrate how coherent errors in shadow estimation protocols can be mitigated using estimates from gate set tomography.
  arXiv  Detail & Related papers  (2021-12-09T19:03:47Z)
• Finite Rate QLDPC-GKP Coding Scheme that Surpasses the CSS Hamming Bound [9.466536273518134]
  We show how to exploit GottesmanKitaev-Preskill (GKP) code with generic quantum low-density parity-check (QLDPC) codes. We also discuss new fundamental and practical questions that arise from this work on channel capacity under GKP analog information.
  arXiv  Detail & Related papers  (2021-11-13T03:42:12Z)
• Quantum error correction with higher Gottesman-Kitaev-Preskill codes: minimal measurements and linear optics [0.0]
  We propose two schemes to obtain Gottesman-Kitaev-Preskill (GKP) error syndromes by means of linear optical operations, homodyne measurements and GKP ancillae. For a concatenation of GKP codes with a stabilizer code only $2n$ measurements are needed in order to obtain the complete syndrome information.
  arXiv  Detail & Related papers  (2021-10-11T14:35:07Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Informationally complete POVM-based shadow tomography [2.9822184411723645]
  We show that an arbitrary informationally complete POVM can compute k-bit correlation functions for quantum states reliably. We also show that, for this application, we do not need the median of means procedure of Huang et al.
  arXiv  Detail & Related papers  (2021-05-12T22:34:42Z)
• Coherent manipulation of graph states composed of finite-energy Gottesman-Kitaev-Preskill-encoded qubits [3.215880910089585]
  Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states is a key task. We consider the finite-energy approximation of GKP qubit states given by a coherent superposition of shifted finite-squeezed vacuum states.
  arXiv  Detail & Related papers  (2021-05-10T12:22:07Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits [0.0]
  The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation. We present a toolkit for phase-space description and manipulation of GKP encodings.
  arXiv  Detail & Related papers  (2020-12-23T05:05:38Z)
• Revisiting the Sample Complexity of Sparse Spectrum Approximation of Gaussian Processes [60.479499225746295]
  We introduce a new scalable approximation for Gaussian processes with provable guarantees which hold simultaneously over its entire parameter space. Our approximation is obtained from an improved sample complexity analysis for sparse spectrum Gaussian processes (SSGPs)
  arXiv  Detail & Related papers  (2020-11-17T05:41:50Z)
• Randomized linear gate set tomography [0.0]
  We introduce randomized linear gate set tomography, an easy-to-implement gate set tomography procedure. We demonstrate the performance of our scheme through simulated examples and experiments done on the IBM Quantum Experience Platform.
  arXiv  Detail & Related papers  (2020-10-23T08:46:11Z)
• Local optimization on pure Gaussian state manifolds [63.76263875368856]
  We exploit insights into the geometry of bosonic and fermionic Gaussian states to develop an efficient local optimization algorithm. The method is based on notions of descent gradient attuned to the local geometry. We use the presented methods to collect numerical and analytical evidence for the conjecture that Gaussian purifications are sufficient to compute the entanglement of purification of arbitrary mixed Gaussian states.
  arXiv  Detail & Related papers  (2020-09-24T18:00:36Z)
• UC-Net: Uncertainty Inspired RGB-D Saliency Detection via Conditional Variational Autoencoders [81.5490760424213]
  We propose the first framework (UCNet) to employ uncertainty for RGB-D saliency detection by learning from the data labeling process. Inspired by the saliency data labeling process, we propose probabilistic RGB-D saliency detection network.
  arXiv  Detail & Related papers  (2020-04-13T04:12:59Z)

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.