Resource-efficient and loss-aware photonic graph state preparation using
an array of quantum emitters, and application to all-photonic quantum
repeaters
- URL: http://arxiv.org/abs/2402.00731v1
- Date: Thu, 1 Feb 2024 16:29:07 GMT
- Title: Resource-efficient and loss-aware photonic graph state preparation using
an array of quantum emitters, and application to all-photonic quantum
repeaters
- Authors: Eneet Kaur, Ashlesha Patil, Saikat Guha
- Abstract summary: We propose an algorithm that can trade the number of emitters with the graph-state depth, while minimizing the number of emitter CNOTs.
We find that our scheme achieves a far superior rate-vs.-distance performance than using the least number of emitters needed to generate the repeater graph state.
- Score: 0.8409980020848168
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Multi-qubit photonic graph states are necessary for quantum communication and
computation. Preparing photonic graph states using probabilistic stitching of
single photons using linear optics results in a formidable resource requirement
due to the need of multiplexing. Quantum emitters present a viable solution to
prepare photonic graph states, as they enable controlled production of photons
entangled with the emitter qubit, and deterministic two-qubit interactions
among emitters. A handful of emitters often suffice to generate useful photonic
graph states that would otherwise require millions of single photon sources
using the linear-optics method. But, photon loss poses an impediment to this
method due to the large depth, i.e., age of the oldest photon, of the graph
state, given the typically large number of slow and noisy two-qubit CNOT gates
required on emitters. We propose an algorithm that can trade the number of
emitters with the graph-state depth, while minimizing the number of emitter
CNOTs. We apply our algorithm to generating a repeater graph state (RGS) for
all-photonic repeaters. We find that our scheme achieves a far superior
rate-vs.-distance performance than using the least number of emitters needed to
generate the RGS. Yet, our scheme is able to get the same performance as the
linear-optics method of generating the RGS where each emitter is used as a
single-photon source, but with orders of magnitude fewer emitters.
Related papers
- Passive photonic CZ gate with two-level emitters in chiral multi-mode waveguide QED [41.94295877935867]
We design a passive conditional gate between co-propagating photons using an array of only two-level emitters.
The key resource is to harness the effective photon-photon interaction induced by the chiral coupling of the emitter array to two waveguide modes.
We show how to harness this non-linear phase shift to engineer a conditional, deterministic photonic gate in different qubit encodings.
arXiv Detail & Related papers (2024-07-08T18:00:25Z) - A complete scheme for atom-mediated deterministic photonic graph state generation [0.0]
Highly-entangled multi-photon graph states are a crucial resource in photonic quantum computation and communication.
We show how harnessing single-atom-based photonic operations can enable deterministic generation of photonic graph states.
arXiv Detail & Related papers (2024-06-02T20:33:40Z) - Heralded photonic graph states with inefficient quantum emitters [2.612403257963011]
Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology.
We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art emitters.
arXiv Detail & Related papers (2024-05-22T00:24:01Z) - Optimization of deterministic photonic graph state generation via local operations [3.2106353278518105]
We introduce an optimization method for such protocols based on the local Clifford equivalency of states and the graph theoretical correlations of the generation cost parameters.
We achieve a 50% reduction in use of the 2-qubit gates for generation of the arbitrary large repeater graph states and similar significant reductions in the total gate count for generation of random dense graphs.
arXiv Detail & Related papers (2024-01-01T02:11:49Z) - Efficient qudit based scheme for photonic quantum computing [0.0]
This work investigates qudits defined by the possible photon number states of a single photon in d > 2 optical modes.
We demonstrate how to construct locally optimal non-deterministic many-qudit gates using linear optics and photon number resolving detectors.
We find that the qudit cluster states require less optical modes and are encoded by a fewer number of entangled photons than the qubit cluster states with similar computational capabilities.
arXiv Detail & Related papers (2023-02-14T21:41:45Z) - On-chip quantum information processing with distinguishable photons [55.41644538483948]
Multi-photon interference is at the heart of photonic quantum technologies.
Here, we experimentally demonstrate that detection can be implemented with a temporal resolution sufficient to interfere photons detuned on the scales necessary for cavity-based integrated photon sources.
We show how time-resolved detection of non-ideal photons can be used to improve the fidelity of an entangling operation and to mitigate the reduction of computational complexity in boson sampling experiments.
arXiv Detail & Related papers (2022-10-14T18:16:49Z) - Near-deterministic hybrid generation of arbitrary photonic graph states
using a single quantum emitter and linear optics [0.0]
We introduce near-deterministic solutions for the generation of graph states using the current quantum emitter capabilities.
Our results should pave the way towards the practical implementation of resource-efficient quantum information processing.
arXiv Detail & Related papers (2022-05-19T17:59:59Z) - All-optical graph representation learning using integrated diffractive
photonic computing units [51.15389025760809]
Photonic neural networks perform brain-inspired computations using photons instead of electrons.
We propose an all-optical graph representation learning architecture, termed diffractive graph neural network (DGNN)
We demonstrate the use of DGNN extracted features for node and graph-level classification tasks with benchmark databases and achieve superior performance.
arXiv Detail & Related papers (2022-04-23T02:29:48Z) - 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) - En route to nanoscopic quantum optical imaging: counting emitters with
photon-number-resolving detectors [8.54443177764705]
Fundamental understanding of biological pathways requires minimally invasive nanoscopic optical resolution imaging.
Many approaches to high-resolution imaging rely on localization of single emitters, such as fluorescent molecule or quantum dot.
We show that quantum measurements of the number of photons emitted from an ensemble of emitters enable the determination of the number of emitters and the probability of emission.
arXiv Detail & Related papers (2021-10-08T04:52:42Z) - Photonic resource state generation from a minimal number of quantum
emitters [0.0]
Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing.
Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it.
arXiv Detail & Related papers (2021-08-27T19:16:56Z) - Regularization by Denoising Sub-sampled Newton Method for Spectral CT
Multi-Material Decomposition [78.37855832568569]
We propose to solve a model-based maximum-a-posterior problem to reconstruct multi-materials images with application to spectral CT.
In particular, we propose to solve a regularized optimization problem based on a plug-in image-denoising function.
We show numerical and experimental results for spectral CT materials decomposition.
arXiv Detail & Related papers (2021-03-25T15:20:10Z) - Rapid characterisation of linear-optical networks via PhaseLift [51.03305009278831]
Integrated photonics offers great phase-stability and can rely on the large scale manufacturability provided by the semiconductor industry.
New devices, based on such optical circuits, hold the promise of faster and energy-efficient computations in machine learning applications.
We present a novel technique to reconstruct the transfer matrix of linear optical networks.
arXiv Detail & Related papers (2020-10-01T16:04:22Z) - A bright and fast source of coherent single photons [46.25143811066789]
A single photon source is a key enabling technology in device-independent quantum communication.
We report a single photon source with an especially high system efficiency.
arXiv Detail & Related papers (2020-07-24T17:08:46Z) - Inverse-designed photon extractors for optically addressable defect
qubits [48.7576911714538]
Inverse-design optimization of photonic devices enables unprecedented flexibility in tailoring critical parameters of a spin-photon interface.
Inverse-designed devices will enable realization of scalable arrays of single-photon emitters, rapid characterization of new quantum emitters, sensing and efficient heralded entanglement schemes.
arXiv Detail & Related papers (2020-07-24T04:30:14Z) - Near-ideal spontaneous photon sources in silicon quantum photonics [55.41644538483948]
Integrated photonics is a robust platform for quantum information processing.
Sources of single photons that are highly indistinguishable and pure, that are either near-deterministic or heralded with high efficiency, have been elusive.
Here, we demonstrate on-chip photon sources that simultaneously meet each of these requirements.
arXiv Detail & Related papers (2020-05-19T16:46:44Z)
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.