Quantum Circuits for Quantum Spatial Search on $d$-Dimensional Lattices

• URL: http://arxiv.org/abs/2607.19151v1
• Date: Tue, 21 Jul 2026 14:51:25 GMT
• Title: Quantum Circuits for Quantum Spatial Search on $d$-Dimensional Lattices
• Abstract summary: We propose an explicit quantum circuit for quantum spatial search based on discrete-time quantum walks on $d$-dimensional lattices.<n>We verify that the proposed circuits reproduce the theoretical dynamics on two- and three-dimensional periodic lattices.
• Score: 2.2336243882030025
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose an explicit quantum circuit for quantum spatial search based on discrete-time quantum walks on $d$-dimensional lattices. In this algorithm, the flip-flop shift operator moves the walker to a neighboring site along the selected spatial direction and reverses the corresponding direction label after the move. By encoding each pair of opposite directions so that they differ only in the least significant qubit of the coin register, we implement the shift using coin-controlled modular increment and decrement operations on the position registers, together with a single $X$ gate that reverses the direction label. We verify that the proposed circuits reproduce the theoretical dynamics on two- and three-dimensional periodic lattices. We further extend the circuit construction to systems with position-dependent shift rules, such as non-periodic boundaries, and validate this extension on a two-dimensional lattice. The resource analysis shows logarithmic growth of the circuit width. For the two-dimensional lattice, the synthesized depth is consistent with $O(\sqrt{N}(\log N)^{3/2})$, while the three-dimensional depth empirically follows an $O(\sqrt{N})$ dependence over the investigated range. Under a CX-gate depolarizing noise model, CX-optimized circuits exhibit improved noise robustness. These results provide a practical framework for implementing quantum spatial search on regular lattices and extending it to defective and other irregular lattice structures.

Related papers

• Generalized Efficient Quantum Circuit Implementation of Discrete-Time Quantum Walks on Cayley Graphs [0.0]
  We introduce a systematic multi-stage decomposition of the shift operator for 1D Cayley graphs.<n>We provide explicit circuit implementations for an 8-Cayley graph and a $mathbbZ_16 times mathbbZ_8$ torus graph.
  arXiv  Detail & Related papers  (2026-08-25T20:35:46Z)
• Exact quantum circuits for lattice Boltzmann realization of the Dirac equation [0.11999555634662634]
  We give a gate-level construction of every operation of the three-dimensional Dirac QLB scheme.<n>We then compose them into single-axis, two- and three-dimensional time steps.<n> circuits reproduce the classical QLB solver to machine precision.
  arXiv  Detail & Related papers  (2026-08-06T20:26:27Z)
• Explicit Block Encoding of Difference-of-Gaussian Operators on a Periodic Grid [1.8920934738244026]
  We construct an explicit quantum block encoding of the Difference-of-Gaussian operator on a periodic grid.<n>We derive an exact closed-form expression for the block-encoding success probability in terms of the input signal's power spectrum.<n>This implementation provides an explicit construction method for a tunable, wide-stencil bandpass filter.
  arXiv  Detail & Related papers  (2026-04-10T17:55:51Z)
• Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation [30.009533492838028]
  Elliptic Curve Discrete Logarithm Problem (ECDLP) is critical for evaluating the quantum security of widely deployed elliptic-curve cryptosystems.<n>We propose a space-efficient modular inversion algorithm for the ECDLP.<n>In particular, for a 256-bit prime-field curve, our estimate reduces the logical-qubit count to 1333, compared with 2124 in the previous low-width implementation of Hner et al.
  arXiv  Detail & Related papers  (2026-04-02T17:52:00Z)
• Barenco gate implementation using driven two- and three-qubit spin chains [1.9078991171384019]
  We propose a protocol for implementing Barenco-type multi-qubit controlled gates using short driven spin chains.<n>We derive explicit conditions on the coupling strengths and driving parameters, provide closed-form expressions for the time-evolution operators in each relevant subspace, and characterize the quality of the implementation using the operator fidelity.<n> Numerical simulations show that the protocol achieves high fidelities over broad parameter ranges, demonstrating its robustness and suitability for quantum information processing in spin-chain platforms.
  arXiv  Detail & Related papers  (2026-03-02T20:56:24Z)
• Quantum-Inspired Algorithms beyond Unitary Circuits: the Laplace Transform [0.0]
  Quantum-inspired algorithms can deliver substantial speedups over classical state-of-the-art methods.<n>We introduce a tensor-network approach to compute the discrete Laplace transform, a non-unitary, aperiodic transform.<n>We demonstrate simulations up to $N=230$ input data points, with up to $260$ output data points, and quantify how bond dimension controls runtime and accuracy.
  arXiv  Detail & Related papers  (2026-01-25T07:19:56Z)
• Quantum Ising Model on $(2+1)-$Dimensional Anti$-$de Sitter Space using Tensor Networks [37.108493798440655]
  We study the quantum Ising model on (2+1)-dimensional anti-de Sitter space using Matrix Product States (MPS) and Matrix Product Operators (MPOs)<n>Our spatial lattices correspond to regular tessellations of hyperbolic space with coordination number seven.<n>We find the ground state of this model using the Density Matrix Renormalization Group (DMRG) algorithm which allowed us to probe lattices that range in size up to 232 sites.
  arXiv  Detail & Related papers  (2025-12-23T23:29:39Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose $Zotimes n$ exponentials of arbitrary length into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions.<n>We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Efficient multi-qubit subspace rotations via topological quantum walks [1.0486921990935787]
  The rotation of subspaces by a chosen angle is a fundamental quantum computing operation. We propose a fast, high-fidelity way to implement such operations via topological quantum walks. This procedure can be implemented in superconducting qubits, ion-traps and Rydberg atoms with star-type connectivity.
  arXiv  Detail & Related papers  (2021-11-12T02:10:56Z)
• Halving the cost of quantum multiplexed rotations [0.0]
  We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls. Our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations.
  arXiv  Detail & Related papers  (2021-10-26T06:49:44Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.