⚛️

Quantum Computing

Learn about quantum algorithms, quantum information theory, and quantum computing applications

10549
Total Items
2661
Papers
277
Videos
31
Books
7418
Blogs
108
News
0
Podcasts
45
GitHub
0
Q&A
Browsing by date

Navigate through content by publication date

Tue, Nov 17

20 items found

1 of 383
📄 paper

Reinforcement Learning designs Quantum Repeater Protocols on Networks beyond the Chain Scenario

Small-scale quantum repeater protocols have been shown to distribute entanglement over existing telecommunication infrastructure by means of short range quantum communications and long range classical messages. For larger networks, there are a number of theoretical proposals about how to operate the network to achieve a good performance under varying metrics. Moreover, since the dimension of the space of possible protocols grows exponentially with network size, plenty of those proposals are based on heuristics that reduce the search space. One of these is entanglement routing, which simplifies the problem on non-linear networks by allocating a series of disjoint paths and running chain protocols simultaneously on them. However, in this work we claim routing leads to suboptimal protocols. In fact, inspired by works on linear chains, we apply reinforcement learning to non-linear networks and optimize over the larger non-routing protocol space. Then, we find protocols that outperform a routed extension of the swap-ASAP protocol, even in the parameter regimes where the latter is widely recognized as the state of the art. These results indicate that routing must be discarded in favor of non-routing methods, while they pave the way towards the design of a sensible Quantum Internet architecture.

Quantum advanced Quantum Physics
By: Andrés Agustí Casado, Álvaro Troyano Olivas, Javier Faba García +3 more
Source: arXiv Nov 16, 2026
0.0
5 min read
0
Quality
📄 paper

Geometry of squeezed states. The phase-space metric, relative vacua and cosmology

Geometry enters quantum theory in two places. The space of quantum states carries a symplectic form, which generates unitary evolution, and a metric, which governs uncertainties and transition probabilities. The classical phase space acquires a metric of its own when a vacuum is chosen: quantizing a linear system amounts to choosing a compatible complex structure, equivalently a compatible metric $g$. We take this second metric as the primary object and show that it plays, on phase space, the role that the quantum metric plays on the space of states: fluctuations of linear observables are $g$-norms of Hamiltonian vector fields, and along coherent states $g/2\hbar$ \emph{is} the quantum metric. Squeezed states then have a simple description. A squeezed vacuum is the vacuum of another metric, and squeezing is a property of a pair of metrics, a relative vacuum, whose invariants are the eigenvalues $e^{\pm2r_i}$ of $L=g_0^{-1}g$. We work out the harmonic oscillator in detail, including why a rotated squeezed state no longer minimizes the product of the displayed uncertainties. Quadratic evolution deforms the metric, and only the part of the generator that is self-adjoint with respect to the reference changes the $r_i$, at a rate we give exactly. For fields, a vacuum is unitarily implementable relative to a reference exactly when it lies at finite distance from it in the space of vacua. For a massless field in de Sitter space we revisit the two canonical charts compared by Grain and Vennin: relative to the reference of the standard squeezing formalism the Bunch--Davies state has $\sinh r_k=1/(2|kη|)$, and relative to the vacuum that a radiation era beginning at time $η$ would select it has $\sinh r_k=1/(2k^2η^2)$. The second comparison squeezes twice as fast and is unitarily implementable; the first is not.

Quantum advanced Quantum Physics
By: Alejandro Corichi, Jerónimo Cortez
Source: arXiv Nov 16, 2026
0.0
10 min read
0
Quality
📄 paper

Exponential Quantum Memory Advantage for Late-Graph Smoothness and Spectral Estimation

Graph signal processing tests how smoothly the decisions of next-generation massive sensor networks with $N$ nodes vary over their neighbour graph. Memory becomes the bottleneck when the neighbour graph arrives only after data erasure, a late-graph setting motivated by dispersed sensor networks and telemetry. We analyse three collection scenarios, reliable rounds, continuous broadcast and ordered capture, and test the Dirichlet energy $\mathcal E_G=\mathbf z^{\mathsf T}\mathbf L\mathbf z/N$ of the fused decision map $\mathbf z\in\{\pm1\}^N$, with late-graph Laplacian $\mathbf L$, against two thresholds. Hidden Matching uses $O(\log N)$ qubits on fused bits, but in reliable rounds and continuous broadcast, where nodes report $b$ sub-bits separately, a classical record buffer before it uses $O(N b)$ bits; classical methods need $Ω(\sqrt N)$ bits in the worst case. The recently introduced Quantum Oracle Sketching builds quantum oracles from random data streams without storing them. We combine coherent loading of separately reported sub-bits, exact in reliable rounds and by Quantum Oracle Sketching in continuous broadcast, with nonlinear fusion and Hidden Matching readout. The register count $R$ does not grow with $N$, and the memory is $O(\log N)$ logical qubits and classical bits, at fixed $b$, graph bounds, thresholds and error targets: an exponential memory advantage over every classical receiver and over Hidden Matching with that buffer. We prove unbiasedness in reliable rounds, preparation bounds in continuous broadcast, classical lower bounds and, for a planner-supplied multi-hop coefficient stream, spectral error bounds. Broadcast simulations match analytic averages at $N=1024$, without resolved bias growth up to $N=2^{20}$. Fault-tolerant hardware, gate rates and, in continuous broadcast, report counts remain open.

Quantum advanced Quantum Physics
By: Burhan Gülbahar
Source: arXiv Nov 16, 2026
0.0
10 min read
0
Quality
📄 paper

Optimal Quantum Sensing Algorithms for Discrete-Frequency Spectroscopy

Spectroscopy is a versatile tool that drives scientific discovery and underpins modern technologies. Quantum sensing offers promising opportunities to advance spectroscopy through enhanced sensitivity and spectral and spatial resolution. However, existing approaches largely focus on improving general measurement capabilities, often overlooking the structure of specific sensing tasks and leaving potential performance gains untapped. Here, we develop an algorithmic approach to quantum sensing tailored to various spectroscopic tasks, providing new avenues for improvement. Specifically, we consider general time-varying signals supported on a known set of $N$ candidate frequencies, a setting we call discrete-frequency spectroscopy. We formulate three types of practically motivated sensing tasks---Detection, Search, and Learning---that require progressively more spectral information. For all tasks, we design optimal quantum sensing algorithms achieving a $\sqrt{N}$ speedup over conventional frequency-scanning approaches. Optimal Detection and Search need only a single-qubit sensor under $π$-pulse control, whereas optimal Learning provably requires coherent processing with a quantum computer. End-to-end numerical simulations incorporating various experimental imperfections predict up to two-orders-of-magnitude speedup in Detection. As an example, we analyze the feasibility of our Detection and Search algorithms for real-world molecular screening based on state-of-the-art nitrogen-vacancy centers. We also show how quantum-computing-enhanced Learning enables wireless communication in a weak-signal regime where conventional methods fail. Our results establish a practical route toward realizing quantum advantages via designing task-specific sensing algorithms.

Quantum advanced Quantum Physics
By: Yu-Jie Liu, Richard R. Allen, Ruohan Shen +4 more
Source: arXiv Nov 16, 2026
0.0
10 min read
0
Quality
📄 paper

Resolving and Suppressing Temporally Correlated Noise in Quantum Error Correction

Scaling fault-tolerant quantum error correction (QEC) requires suppressing errors in both space and time, yet standard logical memory experiments primarily probe spatial faults. Here, we use a 105-qubit Willow superconducting quantum processor to realize and scale the surface code stability experiment, which is alternatively sensitive to temporal error chains. Scaling from patch sizes of $3 \times 3$ to $7 \times 7$, we realize a timelike block suppression factor of $μ_T = 1.47 \pm 0.25$, demonstrating the ability to maintain temporal error suppression as the number of qubits increases. By extending the stability experiment for many cycles, we uncover a sum-of-exponentials behavior in error suppression caused by a temporally correlated error: data-qubit heating to the third excited state $|3\rangle$. We fully capture this effect with a parameter-free, device-level leakage model incorporating higher-state transport during syndrome extraction cycles. To suppress this error, we develop and realize a walking stability circuit, reaching a logical error probability floor of $\le 3.20\times 10^{-8}$ at 60 cycles---two orders of magnitude below the standard construction---and limited by ionizing radiation error bursts. Finally, by adaptively terminating syndrome extraction based on decoder confidence in an offline analysis, we reduce spacetime logical error by 38% and time overhead by 34% compared to the optimal fixed-cycle strategy.

Quantum advanced Quantum Physics
By: Alec Eickbusch, Nick Noll, Michael Newman +359 more
Source: arXiv Nov 16, 2026
0.0
10 min read
0
Quality