Hybrid Quantum Walks Dynamics and Construction of a Quantum Cryptographic Primitive

• URL: http://arxiv.org/abs/2505.15198v1
• Date: Wed, 21 May 2025 07:25:34 GMT
• Title: Hybrid Quantum Walks Dynamics and Construction of a Quantum Cryptographic Primitive
• Authors: Rachana Soni, Navneet Pratap Singh, Neelam Choudhary,
• Abstract summary: The hybrid evolution operator consists of continuous time quantum walks and lackadaisical quantum walks as per choice of bits in binary input message.<n>The quantum hash values generated through the proposed method is showing strong cryptographic properties in sensitivity analysis, collision analysis, statistical features analysis, birthday attack and uniform analysis.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this research article, we design a quantum hash function model from hybrid quantum walks on finite path graph. The hybrid evolution operator consisting of integrated framework of continuous time quantum walks and lackadaisical quantum walks as per choice of bits in binary input message, acts on initial quantum state and generate quantum hash values from probability distribution of final quantum state. The quantum hash values generated through the proposed method is showing strong cryptographic properties in sensitivity analysis, collision analysis, statistical features analysis, birthday attack and uniform analysis. Our proposed framework is showing successful results utilizing mathematically well defined structure of hybrid quantum walks based on quantum mechanics phenomena.

Related papers

• A Quantum-Resistant Photonic Hash Function [0.0]
  We propose a quantum hash function based on Gaussian boson sampling on a photonic quantum computer. Our work lays the foundation for a new paradigm of quantum-resistant hashing with applications in emerging quantum-era information systems.
  arXiv  Detail & Related papers  (2024-09-30T04:19:26Z)
• Evolution of Quantum Resources in Quantum-walk-based Search Algorithm [3.604186493583444]
  We consider the effects of quantum coherence and quantum entanglement for the quantum walk search on the complete bipartite graph. First, we numerically show the complementary relationship between the success probability and the two quantum resources. At last, we discuss the role played by generalized depolarizing noises and find that it would influence the dynamics of success probability and quantum coherence sharply.
  arXiv  Detail & Related papers  (2023-09-30T12:16:28Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Digital Quantum Simulation and Circuit Learning for the Generation of Coherent States [1.4153418423656923]
  Two ways to digitally prepare coherent states in quantum circuits are introduced. The high fidelity of the digitally generated coherent states is verified. The simulation results show that quantum circuit learning can provide high fidelity on learning coherent states by choosing appropriate ansatzes.
  arXiv  Detail & Related papers  (2022-10-30T09:06:21Z)
• Optimisation-free Classification and Density Estimation with Quantum Circuits [0.0]
  We demonstrate the implementation of a novel machine learning framework for probability density estimation and classification using quantum circuits. The framework maps a training data set or a single data sample to the quantum state of a physical system through quantum feature maps. We discuss a variational quantum circuit approach that could leverage quantum advantage for our framework.
  arXiv  Detail & Related papers  (2022-03-28T02:40:24Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• 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)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Quantum information spreading in a disordered quantum walk [50.591267188664666]
  We design a quantum probing protocol using Quantum Walks to investigate the Quantum Information spreading pattern. We focus on the coherent static and dynamic disorder to investigate anomalous and classical transport. Our results show that a Quantum Walk can be considered as a readout device of information about defects and perturbations occurring in complex networks.
  arXiv  Detail & Related papers  (2020-10-20T20:03:19Z)
• On quantum ensembles of quantum classifiers [0.0]
  Quantum machine learning seeks to exploit the underlying nature of a quantum computer to enhance machine learning techniques. A specific implementation of the quantum ensemble of quantum classifiers, called the accuracy-weighted quantum ensemble, can be fully dequantised. On the other hand, the general quantum ensemble framework is shown to contain the well-known Deutsch-Jozsa algorithm that notably provides a quantum speedup.
  arXiv  Detail & Related papers  (2020-01-29T13:46:16Z)

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.