Coined Quantum Walks on Complex Networks for Quantum Computers

• URL: http://arxiv.org/abs/2512.16400v1
• Date: Thu, 18 Dec 2025 10:55:55 GMT
• Title: Coined Quantum Walks on Complex Networks for Quantum Computers
• Authors: Rei Sato,
• Abstract summary: In complex networks, the coin and shift operators depend on the varying degrees of the nodes.<n>We implement the circuit using Qmod, a high-level quantum programming language.<n>We execute the proposed circuits on the ibm_torino superconducting quantum processor for Watts-Strogatz models.
• Score: 2.2336243882030025
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a quantum circuit design for implementing coined quantum walks on complex networks. In complex networks, the coin and shift operators depend on the varying degrees of the nodes, which makes circuit construction more challenging than for regular graphs. To address this issue, we use a dual-register encoding. This approach enables a simplified shift operator and reduces the resource overhead compared to previous methods. We implement the circuit using Qmod, a high-level quantum programming language, and evaluated the performance through numerical simulations on Erdős-Rényi, Watts-Strogatz, and Barabási-Albert models. The results show that the circuit depth scales as approximately $N^{1.9}$ regardless of the network topology. Furthermore, we execute the proposed circuits on the ibm\_torino superconducting quantum processor for Watts-Strogatz models with $N=4$ and $N=8$. The experiments show that hardware-aware optimization slightly improved the $L_1$ distance for the larger graph, whereas connectivity constraints imposed overhead for the smaller one. These results indicate that while current NISQ devices are limited to small-scale validations, the polynomial scaling of our framework makes it suitable for larger-scale implementations in the early fault-tolerant quantum computing era.

Related papers

• Shallow IQP circuit and graph generation [37.067444579637076]
  We introduce shallow instantaneous quantum-time circuits as generative graph models.<n>We study bipartite and ErdHos-R'enyi distributions through simulations and large-scale experiments.
  arXiv  Detail & Related papers  (2025-11-07T14:28:56Z)
• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage [17.38734393793605]
  We propose an approximate method for compiling target quantum circuits into brick-wall layouts.<n>This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers.
  arXiv  Detail & Related papers  (2025-01-13T15:04:39Z)
• Conveyor-belt superconducting quantum computer [0.46603287532620735]
  We present a novel quantum processing unit (QPU) for a universal quantum computer which is globally (rather than locally) driven.<n>Our QPU relies on a string of superconducting qubits with always-on ZZ interactions, enclosed into a closed geometry.<n>The ability to perform multi-qubit operations in a single step could vastly improve the fidelity and execution time of many algorithms.
  arXiv  Detail & Related papers  (2024-12-16T13:51:28Z)
• Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures [41.39072840772559]
  Route-Forcing is a quantum circuit mapping algorithm that shows an average speedup of $3.7times$. We present a quantum circuit mapping algorithm that shows an average speedup of $3.7times$ compared to the state-of-the-art scalable techniques.
  arXiv  Detail & Related papers  (2024-07-24T14:21:41Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Efficient implementation of discrete-time quantum walks on quantum computers [0.0]
  We propose an efficient and scalable quantum circuit implementing the discrete-time quantum walk (DTQW) model. For $t$ time-steps of the DTQW, the proposed circuit requires only $O(n2 + nt)$ two-qubit gates compared to the $O(n2 t)$ of the current most efficient implementation.
  arXiv  Detail & Related papers  (2024-02-02T19:11:41Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Variational-quantum-eigensolver-inspired optimization for spin-chain work extraction [39.58317527488534]
  Energy extraction from quantum sources is a key task to develop new quantum devices such as quantum batteries. One of the main issues to fully extract energy from the quantum source is the assumption that any unitary operation can be done on the system. We propose an approach to optimize the extractable energy inspired by the variational quantum eigensolver (VQE) algorithm.
  arXiv  Detail & Related papers  (2023-10-11T15:59:54Z)
• Implementing arbitrary quantum operations via quantum walks on a cycle graph [8.820803742534677]
  We use a simple discrete-time quantum walk (DTQW) on a cycle graph to model an arbitrary unitary operation $U(N)$. Our model is essentially a quantum neural network based on DTQW.
  arXiv  Detail & Related papers  (2022-10-26T03:51:46Z)
• Co-Designed Architectures for Modular Superconducting Quantum Computers [2.415999158941119]
  Noisy, Intermediate Scale Quantum (NISQ) computers have reached the point where they can show the potential for quantum advantage over classical computing. We propose a co-designed superconducting quantum computer using a Superconducting Asymmetric Inductive eLement modulator.
  arXiv  Detail & Related papers  (2022-05-09T15:42:54Z)
• Optimizing Tensor Network Contraction Using Reinforcement Learning [86.05566365115729]
  We propose a Reinforcement Learning (RL) approach combined with Graph Neural Networks (GNN) to address the contraction ordering problem. The problem is extremely challenging due to the huge search space, the heavy-tailed reward distribution, and the challenging credit assignment. We show how a carefully implemented RL-agent that uses a GNN as the basic policy construct can address these challenges.
  arXiv  Detail & Related papers  (2022-04-18T21:45:13Z)
• Unimon qubit [42.83899285555746]
  Superconducting qubits are one of the most promising candidates to implement quantum computers. Here, we introduce and demonstrate a superconducting-qubit type, the unimon, which combines the desired properties of high non-linearity, full insensitivity to dc charge noise, insensitivity to flux noise, and a simple structure consisting only of a single Josephson junction in a resonator.
  arXiv  Detail & Related papers  (2022-03-11T12:57:43Z)
• A Co-Design Framework of Neural Networks and Quantum Circuits Towards Quantum Advantage [37.837850621536475]
  In this article, we present the co-design framework, namely QuantumFlow, to provide such a missing link. QuantumFlow consists of novel quantum-friendly neural networks (QF-Nets), a mapping tool (QF-Map) to generate the quantum circuit (QF-Circ) for QF-Nets, and an execution engine (QF-FB) Evaluation results show that QF-pNet and QF-hNet can achieve 97.10% and 98.27% accuracy, respectively.
  arXiv  Detail & Related papers  (2020-06-26T06:25:03Z)

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.