Improved entanglement-based high-dimensional optical quantum computation with linear optics
- URL: http://arxiv.org/abs/2602.07971v1
- Date: Sun, 08 Feb 2026 13:48:18 GMT
- Title: Improved entanglement-based high-dimensional optical quantum computation with linear optics
- Abstract summary: We present a family of entanglement-based optical controlled-SWAP gates on $mathbbC2otimes mathbbCdotimes mathbbCd$.<n>With the hybrid encoding, we encode the control qubits and target qudits in photonic polarization and spatial degrees of freedom.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum gates are the essential block for quantum computer. High-dimensional quantum gates exhibit remarkable advantages over their two-dimensional counterparts for some quantum information processing tasks. Here we present a family of entanglement-based optical controlled-SWAP gates on $\mathbb{C}^{2}\otimes \mathbb{C}^{d}\otimes \mathbb{C}^{d}$. With the hybrid encoding, we encode the control qubits and target qudits in photonic polarization and spatial degrees of freedom, respectively. The circuit is constructed using only $(2+3d)$ ($d\geq 2$) linear optics, beating an earlier result of 14 linear optics with $d=2$. The circuit depth 5 is much lower than an earlier result of 11 with $d=2$. Besides, the fidelity of the presented circuit can reach 99.4\%, and it is higher than the previous counterpart with $d=2$. Our scheme are constructed in a deterministic way without any borrowed ancillary photons or measurement-induced nonlinearities. Moreover, our approach allows $d>2$.
Related papers
- $N$-dimensional discrete Fourier transform via bosonic Hamiltonian [33.72751145910978]
We propose bosonic Hamiltonians that realize the $N$-dimensional DFT through a single stage of multimode evolution.<n>We show that the scaling law for implementing the $N$-dimensional DFT with our building blocks is $mathcalO(NloglogN)$.
arXiv Detail & Related papers (2026-09-04T18:27:26Z) - Verifiable quantum advantage in extremely low depth [52.51019642214249]
We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
arXiv Detail & Related papers (2026-09-01T15:54:34Z) - Linear optical fan-out gates using fewer ancillary single photons with enhanced success probability [4.526588192081009]
Photonic quantum gates are fundamental building blocks for a wide range of optical quantum information processing tasks.<n>We propose an efficient linear-optical scheme for implementing a post-selected three-qubit fan-out gate.
arXiv Detail & Related papers (2026-08-16T08:12:42Z) - Expressibility and trainability of a two-dimensional pairwise quantum-circuit ansatz [7.782344682771021]
We construct a native 2D pairwise ansatz and compare its expressibility and trainability with representative 1D ansatze.<n>For the fixed 16-qubit system, the 2D ansatz has the smallest KL divergence at $L=1$ and $2$.<n>We also evaluate the gradient variance of the Pauli-$Z$-string expectation value $langle Z_0otimescdotsotimes Z_15rangle$ with respect to the first $R_y$ angle.
arXiv Detail & Related papers (2026-07-14T17:47:25Z) - Mapping photon-number regimes in single-emitter lasers [41.99844472131922]
We present a numerical analysis of an open quantum system consisting of an incoherently pumped three-level emitter strongly coupled to a single cavity mode.<n>We find that laser behavior can emerge from minimal photon populations.<n>Our findings can be applied to define the operational limits of single-emitter light sources.
arXiv Detail & Related papers (2026-06-30T07:10:49Z) - Approaching transform-limited linewidths in telecom-wavelength transitions of ungated quantum dots [0.0]
We report on a modified Stranski-Krastanov growth scheme using chemical beam epitaxy to enable the generation of high-quality InAs/InP quantum dots.<n>Results represent a significant step in the development of telecom-wavelength quantum light sources.
arXiv Detail & Related papers (2025-09-02T13:46:43Z) - Entanglement-Assisted Coding for Arbitrary Linear Computations Over a Quantum MAC [34.32444379837011]
We study a linear computation problem over a quantum multiple access channel (LC-QMAC)<n>We propose an achievable scheme for LC-QMAC based on the stabilizer formalism and the ideas from entanglement-assisted quantum error-correcting codes (EAQECC)
arXiv Detail & Related papers (2025-01-27T18:35:33Z) - Linear-optical fusion boosted by high-dimensional entanglement [0.0]
We propose a quantum measurement that probabilistically projects a pair of qudits of $d$ onto a Bell state in a two-qubit subspace.
It can be performed using linear-optical circuits with the success probabilities of $1-d-1$ without ancilla photons and $1-d-(k+1)$ with $2(2k-1)$ ancilla photons.
arXiv Detail & Related papers (2024-07-15T16:41:59Z) - A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors [0.0]
We introduce the $textbfLO_fi$-calculus, a graphical language to reason on the infinite-dimensional bosonic Fock space.
We present an equational theory that we prove to be complete: two $textbfLO_fi$-circuits represent the same quantum process.
arXiv Detail & Related papers (2024-02-27T17:08:47Z) - Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion string: Realizing basic quantum algorithms [29.67699443799741]
We demonstrate a quantum processor based on a 3D linear Paul trap that uses $171$Yb$+$ ions with 8 individually controllable four-level qudits (ququarts)
The design of the developed ion trap provides high secular, low heating rate, which, together with individual addressing and readout optical systems, allows executing quantum algorithms.
arXiv Detail & Related papers (2024-02-05T15:48:43Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Single-Mode Squeezed Light Generation and Tomography with an Integrated
Optical Parametric Oscillator [31.874825130479174]
A key resource is squeezed light, where quantum noise is redistributed between optical quadratures.
We introduce a monolithic, chip-scale platform that exploits the $chi(2)$ nonlinearity of a thin-film lithium niobate resonator device.
Our work represents a substantial step toward compact and efficient quantum optical systems.
arXiv Detail & Related papers (2023-10-19T17:53:36Z) - A 2D quantum dot array in planar $^{28}$Si/SiGe [0.0]
First demonstrations of spin qubit arrays have been shown in a wide variety of semiconductor materials.
Highest performance for spin qubit logic has been realized in silicon, but scaling silicon quantum dot arrays in two dimensions has proven to be challenging.
We are able to form a tunnel coupled 2 $times$ 2 quantum dot array in a $28$Si/SiGe heterostructure.
arXiv Detail & Related papers (2023-05-31T09:24:49Z) - High-throughput quantum photonic devices emitting indistinguishable photons in the telecom C-band [28.279056210896716]
Single indistinguishable photons at telecom C-band wavelengths are essential for quantum networks and the future quantum internet.
We demonstrate the high- throughput fabrication of quantum-photonic integrated devices operating at C-band wavelengths based on epitaxial semiconductor quantum dots.
Further improvements in yield and coherence properties will pave the way for implementing single-photon non-linear devices and advanced quantum networks at telecom wavelengths.
arXiv Detail & Related papers (2023-04-05T15:39:22Z) - Unimon qubit [42.83899285555746]
Superconducting qubits are one of the most promising candidates to implement quantum computers.
Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
arXiv Detail & Related papers (2022-03-11T12:57:43Z) - Asymptotically Optimal Circuit Depth for Quantum State Preparation and
General Unitary Synthesis [24.555887999356646]
The problem is of fundamental importance in quantum algorithm design, Hamiltonian simulation and quantum machine learning, yet its circuit depth and size complexity remain open when ancillary qubits are available.
In this paper, we study efficient constructions of quantum circuits with $m$ ancillary qubits that can prepare $psi_vrangle$ in depth.
Our circuits are deterministic, prepare the state and carry out the unitary precisely, utilize the ancillary qubits tightly and the depths are optimal in a wide range of parameter regime.
arXiv Detail & Related papers (2021-08-13T09:47:11Z) - Quantum-classical algorithms for skewed linear systems with optimized
Hadamard test [10.386115383285288]
We discuss hybrid quantum-classical algorithms for skewed linear systems for over-determined and under-determined cases.
Our input model is such that the columns or rows of the matrix defining the linear system are given via quantum circuits of poly-logarithmic depth.
We present an algorithm for the special case of a factorized linear system with run time poly-logarithmic in the respective dimensions.
arXiv Detail & Related papers (2020-09-28T12:59:27Z) - Computational advantage from quantum superposition of multiple temporal
orders of photonic gates [0.0]
A control quantum system can coherently determine the order in which a target quantum system undergoes $N$ gate operations.
We experimentally demonstrate the quantum $N$-switch with $N=4$ gates acting on a photonic-polarization qubit.
This is the first observation of a quantum superposition of more than $N=2$ temporal orders.
arXiv Detail & Related papers (2020-02-18T19:00:01Z)
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.