Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.12949

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

Ce Wang

quant-phmath-phmath.COmath.PRSubmitted Oct 9, 2026• Announced Oct 12, 2026• 0 citations
arXivHTMLPDF

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.

AI Summary

The paper studies a nonlocal rendezvous game on the $d$-dimensional hypercube: uniformly sampled inputs are vertices at Hamming distance $2t$, and each player flips exactly $t$ coordinates, without communication, to reach a common vertex. It asks when classical or finite-dimensional quantum strategies attain the no-signalling optimum. The no-signalling value is computed exactly as $\omega_{\mathrm{NS}}(d,t)=\binom{2t}{t}/\binom dt$. For $d>2t$, finite-dimensional quantum attainment is equivalent to the existence of projections $Q_\zeta$ satisfying $\sum_{|A|=t}Q_{\sigma\triangle A}=I$ for every vertex $\sigma$. The scalar, $\{0,1\}$-valued version characterizes classical saturation. Quantum Bernoulli-noise coordinate-flip operators realize the strategies as one-step walks with entangled coins. Necessity follows from equality conditions in the no-signalling bound, which synchronize measurement projections indexed by the same meeting vertex. For $t=1$, classical saturation occurs exactly when $d$ is a power of two. A real Hadamard matrix of order $d$ supplies rank-one projective resolutions and achieves $\omega_{\mathrm Q}(d)=2/d$. Thus Hadamard orders that are not powers of two yield strict quantum advantage. For $t\ge2$ and $d>2t$, translation symmetrization and a rank-counting contradiction exclude every finite-dimensional projective resolution, hence exact finite-dimensional attainment of the no-signalling value. This obstruction does not establish a strict gap between the quantum supremum and the no-signalling value: approaching sequences and infinite-dimensional strategies are not addressed. Whether a strict quantum–classical separation persists for $t\ge2$ also remains open.

Little sign of AI-generated textUnclear novelty

Error found: The abstract's higher-cardinality nonattainment claim needs the restriction d>2t: when d=2t, fixed complementary t-subset updates give a deterministic classical strategy with success probability one, exactly attaining the no-signalling benchmark.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
20 pages

Related papers

Higher-Dimensional Quantum Walk in Terms of Quantum Bernoulli Noises

Ce Wang, Caishi Wang

As a discrete-time quantum walk model on the one-dimensional integer lattice Z , the quantum walk recently constructed by Wang and Ye [Caishi Wang and Xiaojuan Ye, Quantum walk in terms of quantum Bernoulli noises, Quantum Information Processing 15 (2016), 1897–1908] exhibits quite different features. In this paper, we extend this walk to a higher dimensional case. More precisely, for a general positive integer d ≥ 2 , by using quantum Bernoulli noises we introduce a model of discrete-time quantum walk on the d-dimensional integer lattice Z d , which we call the d-dimensional QBN walk. The d-dimensional QBN walk shares the same coin space with the quantum walk constructed by Wang and Ye, although it is a higher dimensional extension of the latter. Moreover we prove that, for a range of choices of its initial state, the d-dimensional QBN walk has a limit probability distribution of d-dimensional standard Gauss type, which is in sharp contrast with the case of the usual higher dimensional quantum walks. Some other results are also obtained.

Entropy•Apr 28, 2020•4 citations

The uniform measure for quantum walk on hypercube: A quantum Bernoulli noises approach

Ce Wang

In this paper, we present a quantum Bernoulli noises approach to quantum walks on hypercubes. We first obtain an alternative description of a general hypercube, and then, based on the alternative description, we find that the operators ∂k*+∂k behave actually as the shift operators, where ∂k and ∂k* are the annihilation and creation operators acting on Bernoulli functionals, respectively. With the above-mentioned operators as the shift operators on the position space, we introduce a discrete-time quantum walk model on a general hypercube and obtain an explicit formula for calculating its probability distribution at any time. We also establish two limit theorems showing that the averaged probability distribution of the walk even converges to the uniform probability distribution. Finally, we show that the walk produces the uniform measure as its stationary measure on the hypercube provided its initial state satisfies some mild conditions. Some other results are also proven.

arXiv:2211.07948•Journal of Mathematical Physics•Nov 1, 2022•11 citations

Higher-Dimensional Open Quantum Walk Constructed from Quantum Bernoulli Noises

Ce Wang

Quantum Bernoulli noises are annihilation and creation operators acting on Bernoulli functionals, which satisfy the canonical anti-commutation relations (CAR) in equal-time. In this paper, we use quantum Bernoulli noises to introduce a model of open quantum walk on the $d$-dimensional integer lattice $\mathbb{Z}^d$ for a general positive integer $d\geq 2$, which we call the $d$-dimensional open QBN walk. We obtain a quantum channel representation of the $d$-dimensional open QBN walk, and find that it admits the ``separability-preserving'' property. We prove that, for a wide range of choices of its initial state, the $d$-dimensional open QBN walk has a limit probability distribution of $d$-dimensional Gauss type. Finally we unveil links between the $d$-dimensional open QBN walk and the unitary quantum walk recently introduced in [Ce Wang and Caishi Wang, Higher-dimensional quantum walk in terms of quantum Bernoulli noises, Entropy 2020, 22, 504].

arXiv:2006.08090•Jun 15, 2020•0 citations

Higher-dimensional open quantum walk in environment of quantum Bernoulli noises

Ce Wang

Open quantum walks (OQWs) (also known as open quantum random walks) are quantum analogs of classical Markov chains in probability theory, and have potential application in quantum information and quantum computation. Quantum Bernoulli noises (QBNs) are annihilation and creation operators acting on Bernoulli functionals, and can be used as the environment of an open quantum system. In this paper, by using QBNs as the environment, we introduce an OQW on a general higher-dimensional integer lattice. We obtain a quantum channel representation of the walk, which shows that the walk is indeed an OQW. We prove that all the states of the walk are separable provided its initial state is separable. We also prove that, for some initial states, the walk has a limit probability distribution of higher-dimensional Gauss type. Finally, we show links between the walk and a unitary quantum walk recently introduced in terms of QBNs.

Stochastics and Dynamics•Jul 3, 2021•4 citations

Magnetic Quantum Walk on the Hypercube in Terms of Quantum Bernoulli Noises Method

铮 杨

Pure Mathematics•Jan 1, 2025•0 citations

Quantum search with hybrid adiabatic–quantum-walk algorithms and realistic noise

James G. Morley, Nicholas Chancellor, Sougato Bose +1 more

Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near term. Adiabatic quantum computing, quantum annealing, computation by a continuous-time quantum walk, and special purpose quantum simulators all use this strategy. In this work, we carry out a detailed examination of adiabatic and quantum-walk implementation of the quantum search algorithm, using the more physically realistic hypercube connectivity, rather than the complete graph, for our base Hamiltonian. We calculate optimal adiabatic schedules both analytically and numerically for the hypercube and then interpolate between adiabatic and quantum-walk searching, obtaining a family of hybrid algorithms. We show that all of these hybrid algorithms provide the quadratic quantum speedup when run with optimal parameter settings, which we determine and discuss in detail. We incorporate the effects of multiple runs of the same algorithm, noise applied to the qubits, and two types of problem misspecification, determining the optimal hybrid algorithm for each case. Our results reveal a rich structure of how these different computational mechanisms operate and should be balanced in different scenarios. For large systems with low noise and good control, a quantum walk is the best choice, while hybrid strategies can mitigate the effects of many shortcomings in hardware and problem misspecification.

arXiv:1709.00371•Physical Review A•Feb 28, 2019•49 citations
We study quantum-assisted balanced rendezvous on the ddd-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 ttt-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.
The paper studies a nonlocal rendezvous game on the ddd-dimensional hypercube: uniformly sampled inputs are vertices at Hamming distance 2t2t2t, and each player flips exactly ttt coordinates, without communication, to reach a common vertex. It asks when classical or finite-dimensional quantum strategies attain the no-signalling optimum.
The no-signalling value is computed exactly as ωNS(d,t)=(2tt)/(dt)\omega_{\mathrm{NS}}(d,t)=\binom{2t}{t}/\binom dtωNS​(d,t)=(t2t​)/(td​). For d>2td>2td>2t, finite-dimensional quantum attainment is equivalent to the existence of projections QζQ_\zetaQζ​ satisfying ∑∣A∣=tQσ△A=I\sum_{|A|=t}Q_{\sigma\triangle A}=I∑∣A∣=t​Qσ△A​=I for every vertex σ\sigmaσ. The scalar, {0,1}\{0,1\}{0,1}-valued version characterizes classical saturation. Quantum Bernoulli-noise coordinate-flip operators realize the strategies as one-step walks with entangled coins. Necessity follows from equality conditions in the no-signalling bound, which synchronize measurement projections indexed by the same meeting vertex.
For t=1t=1t=1, classical saturation occurs exactly when ddd is a power of two. A real Hadamard matrix of order ddd supplies rank-one projective resolutions and achieves ωQ(d)=2/d\omega_{\mathrm Q}(d)=2/dωQ​(d)=2/d. Thus Hadamard orders that are not powers of two yield strict quantum advantage. For t≥2t\ge2t≥2 and d>2td>2td>2t, translation symmetrization and a rank-counting contradiction exclude every finite-dimensional projective resolution, hence exact finite-dimensional attainment of the no-signalling value.
This obstruction does not establish a strict gap between the quantum supremum and the no-signalling value: approaching sequences and infinite-dimensional strategies are not addressed. Whether a strict quantum–classical separation persists for t≥2t\ge2t≥2 also remains open.
As a discrete-time quantum walk model on the one-dimensional integer lattice Z , the quantum walk recently constructed by Wang and Ye [Caishi Wang and Xiaojuan Ye, Quantum walk in terms of quantum Bernoulli noises, Quantum Information Processing 15 (2016), 1897–1908] exhibits quite different features. In this paper, we extend this walk to a higher dimensional case. More precisely, for a general positive integer d ≥ 2 , by using quantum Bernoulli noises we introduce a model of discrete-time quantum walk on the d-dimensional integer lattice Z d , which we call the d-dimensional QBN walk. The d-dimensional QBN walk shares the same coin space with the quantum walk constructed by Wang and Ye, although it is a higher dimensional extension of the latter. Moreover we prove that, for a range of choices of its initial state, the d-dimensional QBN walk has a limit probability distribution of d-dimensional standard Gauss type, which is in sharp contrast with the case of the usual higher dimensional quantum walks. Some other results are also obtained.
In this paper, we present a quantum Bernoulli noises approach to quantum walks on hypercubes. We first obtain an alternative description of a general hypercube, and then, based on the alternative description, we find that the operators ∂k*+∂k behave actually as the shift operators, where ∂k and ∂k* are the annihilation and creation operators acting on Bernoulli functionals, respectively. With the above-mentioned operators as the shift operators on the position space, we introduce a discrete-time quantum walk model on a general hypercube and obtain an explicit formula for calculating its probability distribution at any time. We also establish two limit theorems showing that the averaged probability distribution of the walk even converges to the uniform probability distribution. Finally, we show that the walk produces the uniform measure as its stationary measure on the hypercube provided its initial state satisfies some mild conditions. Some other results are also proven.
Quantum Bernoulli noises are annihilation and creation operators acting on Bernoulli functionals, which satisfy the canonical anti-commutation relations (CAR) in equal-time. In this paper, we use quantum Bernoulli noises to introduce a model of open quantum walk on the ddd-dimensional integer lattice Zd\mathbb{Z}^dZd for a general positive integer d≥2d\geq 2d≥2, which we call the ddd-dimensional open QBN walk. We obtain a quantum channel representation of the ddd-dimensional open QBN walk, and find that it admits the ``separability-preserving'' property. We prove that, for a wide range of choices of its initial state, the ddd-dimensional open QBN walk has a limit probability distribution of ddd-dimensional Gauss type. Finally we unveil links between the ddd-dimensional open QBN walk and the unitary quantum walk recently introduced in [Ce Wang and Caishi Wang, Higher-dimensional quantum walk in terms of quantum Bernoulli noises, Entropy 2020, 22, 504].
Open quantum walks (OQWs) (also known as open quantum random walks) are quantum analogs of classical Markov chains in probability theory, and have potential application in quantum information and quantum computation. Quantum Bernoulli noises (QBNs) are annihilation and creation operators acting on Bernoulli functionals, and can be used as the environment of an open quantum system. In this paper, by using QBNs as the environment, we introduce an OQW on a general higher-dimensional integer lattice. We obtain a quantum channel representation of the walk, which shows that the walk is indeed an OQW. We prove that all the states of the walk are separable provided its initial state is separable. We also prove that, for some initial states, the walk has a limit probability distribution of higher-dimensional Gauss type. Finally, we show links between the walk and a unitary quantum walk recently introduced in terms of QBNs.
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near term. Adiabatic quantum computing, quantum annealing, computation by a continuous-time quantum walk, and special purpose quantum simulators all use this strategy. In this work, we carry out a detailed examination of adiabatic and quantum-walk implementation of the quantum search algorithm, using the more physically realistic hypercube connectivity, rather than the complete graph, for our base Hamiltonian. We calculate optimal adiabatic schedules both analytically and numerically for the hypercube and then interpolate between adiabatic and quantum-walk searching, obtaining a family of hybrid algorithms. We show that all of these hybrid algorithms provide the quadratic quantum speedup when run with optimal parameter settings, which we determine and discuss in detail. We incorporate the effects of multiple runs of the same algorithm, noise applied to the qubits, and two types of problem misspecification, determining the optimal hybrid algorithm for each case. Our results reveal a rich structure of how these different computational mechanisms operate and should be balanced in different scenarios. For large systems with low noise and good control, a quantum walk is the best choice, while hybrid strategies can mitigate the effects of many shortcomings in hardware and problem misspecification.