相关论文: Comparison of LOQC C-sign gates with ancilla ineff…

We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous…

Typically linear optical quantum computing (LOQC) models assume that all input photons are completely indistinguishable. In practice there will inevitably be non-idealities associated with the photons and the experimental setup which will…

We simulate the implementation of a T-gate, or $\frac{\pi}{8}$-gate, for a [7,1,3] encoded logical qubit in a non-equiprobable error environment. We demonstrate that the use of certain non-fault tolerant methods in the implementation may…

We propose and analyze heralded quantum gates between qubits in optical cavities. They employ an auxiliary qubit to report if a successful gate occurred. In this manner, the errors, which would have corrupted a deterministic gate, are…

A possible alternative to the standard model of measurement-based quantum computation (MBQC) is offered by the sequential model of MBQC -- a particular class of quantum computation via ancillae. Although these two models are equivalent…

Ancilla post-selection is a common means of achieving fault-tolerance in quantum error-correction. However, it can lead to additional data errors due to movement or wait operations. Alternatives to post-selection may achieve lower overall…

We describe a simple scheme for implementing the non-linear sign gate of Knill, Laflamme and Milburn (Nature, {\bf 409}, 46-52, Jan. 4 (2001)) which forms the basis of an experiment underway at the University of Vienna.

Quantum information processing using linear optics is challenging due to the limited set of deterministic operations achievable without using complicated resource-intensive methods. While techniques such as the use of ancillary photons can…

LLM systems must make control decisions in addition to generating outputs: whether to answer, clarify, retrieve, call tools, repair, or escalate. In many current architectures, these decisions remain implicit within generation, entangling…

One of the main problems that optical quantum computing has to overcome is the efficient construction of two-photon gates. Theoretically these gates can be realized using Kerr-nonlinearities, but the techniques involved are experimentally…

Linear optical quantum computation (LOQC) offers a promising platform for scalable quantum information processing, but its scalability is fundamentally constrained by the probabilistic nature of non-local entangling gates. Qudit circuit…

In this paper, we investigate performance improvements of low-power long-range (LoRa) modulation when a gateway is equipped with multiple antennas. We derive the optimal decision rules for both coherent and non-coherent detections when…

We provide a critical review of the fundamental concepts of Kerr lens mode-locking (KLM), along with a detailed description of the experimental considerations involved in the realization of a mode-locked oscillator. In addition, we review…

It is well known that an unambiguous discrimination of the four optically encoded Bell states is possible with a probability of $50\%$ at best, when using static, passive linear optics and arbitrarily many vacuum mode ancillae. By adding…

One of the most significant challenges facing the development of linear optics quantum computing (LOQC) is mode-mismatch, whereby photon distinguishability is introduced within circuits, undermining quantum interference effects. We examine…

Effective log anomaly detection is critical to sustaining reliability in large-scale IT infrastructures. Transformer-based models require substantial resources and labeled data, exacerbating the cold-start problem in target domains where…

Realization of quantum computing requires the development of high-fidelity quantum gates that are resilient to decoherence, control errors, and environmental noise. While non-adiabatic holonomic quantum computation (NHQC) offers a promising…

Geometric quantum gates are often expected to be more resilient than dynamical gates against certain types of error, which would make them ideal for robust quantum computing. However, this is still up for debate due to seemingly conflicting…

Quantum linear system algorithms (QLSA) have the potential to speed up Interior Point Methods (IPM). However, a major challenge is that QLSAs are inexact and sensitive to the condition number of the coefficient matrices of linear systems.…

This work addresses the open question of implementing fault-tolerant QRLCs with feasible computational overhead. We present a new decoder for quantum random linear codes (QRLCs) capable of dealing with imperfect decoding operations. A first…