Quantum-classical distance as a tool to design optimal chiral quantum walk

• URL: http://arxiv.org/abs/2106.11685v1
• Date: Tue, 22 Jun 2021 11:38:58 GMT
• Title: Quantum-classical distance as a tool to design optimal chiral quantum walk
• Authors: Massimo Frigerio and Claudia Benedetti and Stefano Olivares and Matteo G. A. Paris
• Abstract summary: Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search. We argue that the quantum-classical distance, a figure of merit introduced to capture the difference in dynamics between a CTQW and its classical counterpart, guides the optimization of parameters of the Hamiltonian.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Continuous-time quantum walks (CTQWs) provide a valuable model for quantum transport, universal quantum computation and quantum spatial search, among others. Recently, the empowering role of new degrees of freedom in the Hamiltonian generator of CTQWs, which are the complex phases along the loops of the underlying graph, was acknowledged for its interest in optimizing or suppressing transport on specific topologies. We argue that the quantum-classical distance, a figure of merit which was introduced to capture the difference in dynamics between a CTQW and its classical, stochastic counterpart, guides the optimization of parameters of the Hamiltonian to achieve better quantum transport on cycle graphs and spatial search to the quantum speed limit without an oracle on complete graphs, the latter also implying fast uniform mixing. We compare the variations of this quantity with the 1-norm of coherence and the Inverse Participation Ratio, showing that the quantum-classical distance is linked to both, but in a topology-dependent relation, which is key to spot the most interesting quantum evolution in each case.

Related papers

• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Amplification of quantum transfer and quantum ratchet [56.47577824219207]
  We study a model of amplification of quantum transfer and making it directed which we call the quantum ratchet model. The ratchet effect is achieved in the quantum control model with dissipation and sink, where the Hamiltonian depends on vibrations in the energy difference synchronized with transitions between energy levels. Amplitude and frequency of the oscillating vibron together with the dephasing rate are the parameters of the quantum ratchet which determine its efficiency.
  arXiv  Detail & Related papers  (2023-12-31T14:04:43Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Quantum speed limits on operator flows and correlation functions [0.0]
  Quantum speed limits (QSLs) identify fundamental time scales of physical processes by providing lower bounds on the rate of change of a quantum state or the expectation value of an observable. We derive two types of QSLs and assess the existence of a crossover between them, that we illustrate with a qubit and a random matrix Hamiltonian. We further apply our results to the time evolution of autocorrelation functions, obtaining computable constraints on the linear response of quantum systems out of equilibrium and the quantum Fisher information governing the precision in quantum parameter estimation.
  arXiv  Detail & Related papers  (2022-07-12T18:00:07Z)
• Decoherence and classicalization of continuous-time quantum walks on graphs [0.0]
  We show that the dynamics arising from decoherence, i.e. dephasing in the energy basis, do not fully classicalize the walker. On the other hand, dephasing in the position basis, as described by the Haken-Strobl master equation or by the quantum walk (QSW) model, induceally destroys the quantumness of the walker. We also investigate the speed of the classicalization process, and observe a faster convergence of the QC-distance to its value for intrinsic decoherence and the QSW models.
  arXiv  Detail & Related papers  (2022-04-04T20:40:47Z)
• Measurement-induced entanglement phase transitions in variational quantum circuits [0.4499833362998487]
  Variational quantum algorithms (VQAs) classically optimize a parametrized quantum circuit to solve a computational task. We study the entanglement transition in variational quantum circuits endowed with intermediate projective measurements. Our work paves an avenue for greatly improving the trainability of quantum circuits by incorporating intermediate measurement protocols in currently available quantum hardware.
  arXiv  Detail & Related papers  (2021-11-15T19:00:28Z)
• 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)
• 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)
• Detecting out-of-time-order correlations via quasi-adiabatic echoes as a tool to reveal quantum coherence in equilibrium quantum phase transitions [0.0]
  We show that an abrupt change in coherence and entanglement of the ground state is observable in the spectrum of multiple quantum coherence intensities. Our scheme allows for the detection of OTOCs without time-reversal of coherent dynamics.
  arXiv  Detail & Related papers  (2020-06-01T23:28:44Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.