Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.12949

Quantum-assisted rendezvous on hypercubes: a quantum Bernoulli noise approach

Ce Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study quantum-assisted balanced rendezvous on the $d$-dimensional hypercube in a one-step two-agent quantum-walk framework, where the two agents move the same Hamming distance and meet at a common midpoint. The key structure is a projective $t$-sphere resolution, which governs exact finite-dimensional quantum attainment. Its scalar analogue recovers the corresponding classical characterization. We characterize finite-dimensional quantum attainment of the no-signalling benchmark, construct quantum strategies from projective sphere resolutions, and establish a rigidity theorem for optimal finite-dimensional strategies. A marked difference appears between nearest-neighbor and higher-cardinality updates: quantum advantage can occur in the former, whereas in the latter the geometry of the relevant Hamming spheres rules out exact finite-dimensional attainment of the no-signalling value. Together, these results connect quantum-walk dynamics, Hamming-sphere geometry, and quantum rendezvous within the quantum Bernoulli noises (QBN) framework.

Explore related subjects

quant-phmath-phmath.COmath.MPmath.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ce Wang. 2026-10-09. Quantum-assisted rendezvous on hypercubes: a quantum Bernoulli noise approach. https://arxiv.org/abs/2610.12949

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Erasing Photon-Number Correlations through Hong-Ou-Mandel Interference

A parametric down-conversion source interfering on a beam splitter can be described as both a source of entangled N00N-states or a source of independent, and thus uncorrelated squeezers. The disparity between these outcomes can be attributed to whether one takes a standard discrete- or continuous-variable approach to describing the system. More precisely, this difference in output is due to the types of measurements involved and the way in which the data is processed, as both setups are identical, clearly identical states are produced. Here we take a hybrid approach to describe the state, which is generated by parametric down-conversion as input state, and investigate the measurements of the output ports of the interferometer using photon number resolved detection. We show that the output of this interference is separable in the photon number picture and demonstrate the worth of photon-number correlation measures for the characterization of squeezed light sources for hybrid applications like Gaussian boson-sampling.

quant-ph↗
arXiv2026

High-throughput bidirectional electro-optic transduction assessed with a practical quantum capacity

A microwave-optical transducer of sufficiently low noise and high signal transfer rate would allow entanglement to be distributed between superconducting quantum processors reliably within the lifetimes of their quantum memories. We report the continuous operation of an efficient transducer at high enough bandwidth to realize kHz signal transfer rates, in downconversion as well as upconversion, with noise levels approaching that required for quantum information transfer. To define the significance of our advance and clarify the multifaceted performance required for quantum networking tasks, we derive a broadband quantum channel capacity that bounds the maximum rate at which quantum information can be sent through realistic finite-bandwidth thermal-loss channels. This capacity serves as a comprehensive measure of transducer capability and provides insight into the relative importance of disparate performance metrics. We find that the broadband capacity depends on the throughput---defined as the product of efficiency, bandwidth, and duty cycle---and on the added noise. We present measurements of a membrane-based opto-electromechanical transducer with high throughput of 7 kHz and at an input-referred added noise of 3 photons in both upconversion and downconversion, demonstrating that bidirectional transducer capacities comparable to superconducting qubit decay rates are within reach. In downconversion, throughput of this magnitude at the few-photon noise level is unprecedented, marking an improvement of nearly four orders of magnitude over previous work.

quant-ph↗
arXiv2026

Noise Thresholds for Quantum Advantage in the Bernstein-Vazirani and Deutsch-Jozsa Algorithms

We analytically investigate the robustness of the Bernstein-Vazirani and Deutsch-Jozsa algorithms against single-qubit Pauli noise, of which bit-flip, phase-flip, and depolarizing noise are special cases, using the density-matrix formalism. For a general Pauli channel acting on each qubit after every gate, we derive exact closed-form expressions for the success probability of a single run as a function of the error probabilities and the number of qubits $n$, and validate them against Qiskit simulations. The noise enters only through the probability $\varepsilon$ with which each output bit is flipped. Under bit-flip noise with error probability $p > 1/2$ the most probable outcome of the Bernstein-Vazirani algorithm is the complement of the correct one, which classical post-processing corrects, whereas depolarizing and phase-flip noise never bias the output toward a wrong outcome. For the Deutsch-Jozsa algorithm, the success probability is the average over constant and balanced oracles, and the results are given for the single-variable balanced oracle, which is shown to be the least robust of all balanced oracles for $\varepsilon < 1/2$. For a single run, the tolerable error probability of both algorithms decreases as $1/n$. We then determine the minimum number of repetitions required for a given confidence and compare it with the number of queries of the classical algorithms. The threshold error probability below which the noisy Bernstein-Vazirani algorithm retains its query advantage increases with $n$, whereas that of the Deutsch-Jozsa algorithm with its standard readout decreases as $1/n$. This contrast indicates that algorithms whose answer is encoded in many independently decodable output bits are considerably more robust to noise than algorithms whose verdict depends on a single global outcome.

quant-ph↗