Arbitrary coherent distributions in a programmable quantum walk

• URL: http://arxiv.org/abs/2202.09630v1
• Date: Sat, 19 Feb 2022 15:56:45 GMT
• Title: Arbitrary coherent distributions in a programmable quantum walk
• Authors: Rong Zhang, Ran Yang, Jian Guo, Chang-Wei Sun, Yi-Chen Liu, Heng Zhou, Ping Xu, Zhenda Xie, Yan-Xiao Gong, Shi-Ning Zhu
• Abstract summary: coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications. We experimentally demonstrate that the rich dynamics featured with arbitrary coherent distributions can be obtained by introducing different sets of the time- and position-dependent operations. Our results contribute to the practical realization of quantum-walk-based quantum computation, quantum simulations and quantum information protocols.
• Score: 9.037302699507409
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The coherent superposition of position states in a quantum walk (QW) can be precisely engineered towards the desired distributions to meet the need of quantum information applications. The coherent distribution can make full use of quantum parallel in computation and simulation. Particularly, the uniform superposition provides the robust non-locality, which has wide applications such as the generation of genuine multi-bit random numbers without post-processing. We experimentally demonstrate that the rich dynamics featured with arbitrary coherent distributions can be obtained by introducing different sets of the time- and position-dependent operations. Such a QW is realized by a resource-constant and flexible optical circuit, in which the variable operation is executed based on a Sagnac interferometer in an intrinsically stable and precisely controlled way. Our results contribute to the practical realization of quantum-walk-based quantum computation, quantum simulations and quantum information protocols.

Related papers

• Distributed Quantum Simulation [13.11934294941432]
  We propose communication-efficient distributed quantum simulation protocols. Our protocols are shown to be optimal by deriving a lower bound on the quantum communication complexity. Our work paves the way for achieving a practical quantum advantage by scalable quantum simulation.
  arXiv  Detail & Related papers  (2024-11-05T07:48:40Z)
• Simulation of open quantum systems on universal quantum computers [15.876768787615179]
  We present an innovative and scalable method to simulate open quantum systems using quantum computers. We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel. accurate long-time simulation can also be achieved as the adjoint density matrix and the true dissipated one converges to the same state.
  arXiv  Detail & Related papers  (2024-05-31T09:07:27Z)
• Quantum algorithms in distributed quantum computing [0.0]
  Distributed quantum computing (DQC) provides a way to scale quantum computers using multiple quantum processing units (QPU) which are connected through quantum communication links. We have built a distributed quantum computing simulator and used it to investigate quantum algorithms. We show the applicability of dynamic quantum circuits in DQC, where mid-circuit measurements, local operations, and classical communication are used in place of noisy inter-processor (nonlocal) quantum gates.
  arXiv  Detail & Related papers  (2024-02-16T15:05:15Z)
• Reliable confidence regions for quantum tomography using distribution moments [0.0]
  We suggest a computationally efficient and reliable scheme for determining well-justified error bars for quantum tomography. We benchmark our approach for a number of quantum tomography protocols using both simulation and demonstration with the use of a cloud-accessible quantum processor.
  arXiv  Detail & Related papers  (2023-07-24T14:21:35Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
  We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics. The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system. Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
  arXiv  Detail & Related papers  (2021-03-05T08:32:43Z)
• Quantum Markov Chain Monte Carlo with Digital Dissipative Dynamics on Quantum Computers [52.77024349608834]
  We develop a digital quantum algorithm that simulates interaction with an environment using a small number of ancilla qubits. We evaluate the algorithm by simulating thermal states of the transverse Ising model.
  arXiv  Detail & Related papers  (2021-03-04T18:21:00Z)
• Continuous-time dynamics and error scaling of noisy highly-entangling quantum circuits [58.720142291102135]
  We simulate a noisy quantum Fourier transform processor with up to 21 qubits. We take into account microscopic dissipative processes rather than relying on digital error models. We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
  arXiv  Detail & Related papers  (2021-02-08T14:55:44Z)
• 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)
• Detecting dynamical quantum phase transition via out-of-time-order correlations in a solid-state quantum simulator [12.059058714600607]
  We develop and experimentally demonstrate that out-of-time-order correlators can be used to detect nonoequilibrium phase transitions in the transverse field Ising model. Further applications of this protocol could enable studies other of exotic phenomena such as many body localization, and tests of the holographic duality between quantum and gravitational systems.
  arXiv  Detail & Related papers  (2020-01-17T14:28:42Z)

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.