General protocols for the efficient distillation of indistinguishable photons

• URL: http://arxiv.org/abs/2404.14217v2
• Date: Sun, 5 May 2024 18:14:11 GMT
• Title: General protocols for the efficient distillation of indistinguishable photons
• Authors: Jason Saied, Jeffrey Marshall, Namit Anand, Eleanor G. Rieffel,
• Abstract summary: We introduce protocols for the distillation of indistinguishable photons. The protocols reduce distinguishability error rates by a factor of $n$, with resource requirements scaling linearly in $n$. We observe that the same symmetry properties governing suppression laws are instrumental in understanding the behavior of these protocols.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Highly pure and indistinguishable photons are a prerequisite for use in quantum information processing. We introduce protocols for the distillation of indistinguishable photons that offer a significant improvement over previous work, reducing distinguishability error rates by a factor of $n$, with resource requirements scaling linearly in $n$. We present the protocols, based on the discrete Fourier transform, Hadamard (Sylvester) matrices, and more general Fourier transforms on finite abelian groups, then give both analytical and numerical results regarding their performance. We observe that the same symmetry properties governing suppression laws are instrumental in understanding the behavior of these distillation protocols. We also prove that for the $n$-photon discrete Fourier transform, the suppression laws are exactly characterized by the well-known Zero Transmission Law based on permutation symmetry if and only if $n$ is a prime power.

Related papers

• Straightness of Rectified Flow: A Theoretical Insight into Wasserstein Convergence [54.580605276017096]
  Diffusion models have emerged as a powerful tool for image generation and denoising. Recently, Liu et al. designed a novel alternative generative model Rectified Flow (RF) RF aims to learn straight flow trajectories from noise to data using a sequence of convex optimization problems.
  arXiv  Detail & Related papers  (2024-10-19T02:36:11Z)
• Surpassing the fundamental limits of distillation with catalysts [2.107610564835429]
  We show that quantum catalysts can help surpass previously known fundamental limitations on distillation overhead. In particular, in context of magic state distillation, our result indicates that the code-based low-overhead distillation protocols can be promoted to the one-shot setting. We demonstrate that enables a spacetime trade-off between overhead and success probability.
  arXiv  Detail & Related papers  (2024-10-18T15:41:52Z)
• Photon distillation schemes with reduced resource costs based on multiphoton Fourier interference [0.0]
  We present a scalable scheme to achieve photon distillation, i.e. the preparation of a single photon with reduced indistinguishability error out of multiple imperfect photons. Our scheme achieves arbitrary error reduction in a single step, removing the need to multiple rounds of the protocol. We find that the scheme both raises the threshold of error correcting codes in photonic quantum computers, as well as reduces the resources required to construct a photonic quantum computer.
  arXiv  Detail & Related papers  (2024-04-22T15:11:25Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• Transformers as Support Vector Machines [54.642793677472724]
  We establish a formal equivalence between the optimization geometry of self-attention and a hard-margin SVM problem. We characterize the implicit bias of 1-layer transformers optimized with gradient descent. We believe these findings inspire the interpretation of transformers as a hierarchy of SVMs that separates and selects optimal tokens.
  arXiv  Detail & Related papers  (2023-08-31T17:57:50Z)
• Outlier Suppression: Pushing the Limit of Low-bit Transformer Language Models [57.933500846742234]
  Recent work recognizes that structured outliers are the critical bottleneck for quantization performance. We propose an outlier suppression framework including two components: Gamma Migration and Token-Wise Clipping. This framework effectively suppresses the outliers and can be used in a plug-and-play mode.
  arXiv  Detail & Related papers  (2022-09-27T12:05:59Z)
• Distillation of Indistinguishable Photons [0.0]
  A reliable source of identical (indistinguishable) photons is a prerequisite for interference effects. We present a protocol which can be used to increase the indistinguishability of a photon source, to arbitrary accuracy. We demonstrate the scheme is robust to detection and control errors in the optical components, and discuss the effect of other error sources.
  arXiv  Detail & Related papers  (2022-03-29T02:27:07Z)
• Unified Multivariate Gaussian Mixture for Efficient Neural Image Compression [151.3826781154146]
  latent variables with priors and hyperpriors is an essential problem in variational image compression. We find inter-correlations and intra-correlations exist when observing latent variables in a vectorized perspective. Our model has better rate-distortion performance and an impressive $3.18times$ compression speed up.
  arXiv  Detail & Related papers  (2022-03-21T11:44:17Z)
• Hybrid Model-based / Data-driven Graph Transform for Image Coding [54.31406300524195]
  We present a hybrid model-based / data-driven approach to encode an intra-prediction residual block. The first $K$ eigenvectors of a transform matrix are derived from a statistical model, e.g., the asymmetric discrete sine transform (ADST) for stability. Using WebP as a baseline image, experimental results show that our hybrid graph transform achieved better energy compaction than default discrete cosine transform (DCT) and better stability than KLT.
  arXiv  Detail & Related papers  (2022-03-02T15:36:44Z)
• Truncated phase-based quantum arithmetic: error propagation and resource reduction [0.0]
  We present a modification of the Draper quantum Fourier adder which eliminates small-angle rotations to highly coarse levels. We show that the inherited loss of fidelity is directly given by the rate of carry and borrow bits in the subroutine. Surprisingly, we find that each of the $7times 107$ quantum Fourier transforms may be truncated down to $pi/64$, with additive rotations left only slightly finer.
  arXiv  Detail & Related papers  (2021-10-01T05:19:03Z)
• Optimised Domain-engineered Crystals for Pure Telecom Photon Sources [101.18253437732933]
  We present a telecom-wavelength parametric down-conversion photon source that operates on the achievable limit of domain engineering. We generate photons from independent sources which achieve two-photon interference visibilities of up to $98.6pm1.1%$ without narrow-band filtering.
  arXiv  Detail & Related papers  (2021-01-20T19:00:04Z)
• Experimental study of continuous variable quantum key distribution [0.22099217573031674]
  main technological factors limiting the communication rates of quantum cryptography systems by single photon are mainly related to the choice of the encoding method. We propose a new reconciliation method based on Turbo codes. Our method leads to a significant improvement of the protocol security and a large decrease of the QBER.
  arXiv  Detail & Related papers  (2020-02-16T21:50:31Z)

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.