Quantum walk with coherent multiple translations induces fast quantum gate operations

• URL: http://arxiv.org/abs/2504.04990v1
• Date: Mon, 07 Apr 2025 12:14:19 GMT
• Title: Quantum walk with coherent multiple translations induces fast quantum gate operations
• Authors: Yixiang Zhang, Xin Qiao, Luojia Wang, Yanyan He, Zhaohui Dong, Xianfeng Chen, Luqi Yuan,
• Abstract summary: We study a ring under the strong resonant modulation that can support discrete-time quantum walk.<n>Multiple translation paths are added in a coherent way, which makes the walker evolve under the topological band.<n>Our study uses a single ring to provide fast quantum gate operations based on coherent multiple path quantum walk.
• Score: 1.7532494590119037
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong resonant modulation that can support discrete-time quantum walk including coherent multiple long-range translations in a natural way along synthetic frequency dimension. These multiple translation paths are added in a coherent way, which makes the walker evolve under the topological band. Therein, not only the fast diffusion speed is expected, but more importantly, we find that single quantum gate operations can be performed in the quasi-momentum space. In particular, we show the arbitrary single-qubit state preparation and an example of CNOT two-qubit gate with only one time step, dramarically increasing quantum algorithms. Our study uses a single ring to provide fast quantum gate operations based on coherent multiple path quantum walk, which may provide unique designs for efficient quantum operations on photonic chips.

Related papers

• A Universal Quantum Computer From Relativistic Motion [0.5999777817331317]
  We present an explicit construction of a relativistic quantum computing architecture using a variational quantum circuit approach. The variational quantum circuit consists of tunable single-qubit rotations and entangling gates that are implemented successively.
  arXiv  Detail & Related papers  (2024-10-31T18:01:02Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Diamond-shaped quantum circuit for real-time quantum dynamics in one dimension [0.0]
  We show that quantum many-body states can be universally represented using a quantum circuit comprising multi-qubit gates. We also evaluate the efficiency of a quantum circuit constructed with two-qubit gates in quench dynamics for the transverse-field Ising model. Our results reveal that a diamond-shaped quantum circuit, designed to approximate the multi-qubit gate-based quantum circuit, remarkably excels in accurately representing the long-time dynamics of the system.
  arXiv  Detail & Related papers  (2023-11-10T07:07:54Z)
• A vertical gate-defined double quantum dot in a strained germanium double quantum well [48.7576911714538]
  Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation. We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well. We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
  arXiv  Detail & Related papers  (2023-05-23T13:42:36Z)
• Efficient parallelization of quantum basis state shift [0.0]
  We optimize the state shift algorithm by incorporating the shift in different directions in parallel. This provides a significant reduction in the depth of the quantum circuit in comparison to the currently known methods. We focus on the one-dimensional and periodic shift, but note that the method can be extended to more complex cases.
  arXiv  Detail & Related papers  (2023-04-04T11:01:08Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Quantum walks on random lattices: Diffusion, localization and the absence of parametric quantum speed-up [0.0]
  We study propagation of quantum walks on percolation-generated two-dimensional random lattices. We show that even arbitrarily weak concentrations of randomly removed lattice sites give rise to a complete breakdown of the superdiffusive quantum speed-up. The fragility of quantum speed-up implies dramatic limitations for quantum information applications of quantum walks on random geometries and graphs.
  arXiv  Detail & Related papers  (2022-10-11T10:07:52Z)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
  We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
  arXiv  Detail & Related papers  (2020-12-22T13:06:12Z)
• Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings [0.0]
  We apply the idea of Floquet engineering in the context of continuous-time quantum walks on graphs. We define periodically-driven Hamiltonians which can be used to simulate the dynamics of certain target quantum walks. Our work provides explicit simulation protocols that may be used for directing quantum transport, engineering the dispersion relation of one-dimensional quantum walks or investigating quantum dynamics in highly connected structures.
  arXiv  Detail & Related papers  (2020-12-01T12:46:56Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Multi-qubit quantum computing using discrete-time quantum walks on closed graphs [2.781051183509143]
  Universal quantum computation can be realised using both continuous-time and discrete-time quantum walks. We present a version based on single particle discrete-time quantum walk to realize multi-qubit computation tasks.
  arXiv  Detail & Related papers  (2020-04-13T14:12:05Z)

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.