Related papers: Efficient Equivalent of Shallow Quantum Hashing

Efficient Equivalent of Shallow Quantum Hashing

URL: http://arxiv.org/abs/2511.19292v1
Date: Mon, 24 Nov 2025 16:38:17 GMT
Title: Efficient Equivalent of Shallow Quantum Hashing
Authors: Ilnar Zinnatullin, Alexander Vasiliev,
Abstract summary: We establish a connection between shallow quantum hashing and single-qubit quantum hashing for the amplitude form.<n>For a shallow circuit, we propose a circuit of depth 1 that achieves the same collision resistance.
Score: 45.88028371034407
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Quantum hashing is a widely used technique in quantum computation that allows us to design space-efficient algorithms and protocols. Recently, Vasiliev has shown that the phase form of shallow quantum hashing can be implemented by a circuit of depth 2. In this paper, we establish a connection between shallow quantum hashing and single-qubit quantum hashing for the amplitude form. For a shallow circuit, we propose a circuit of depth 1 that achieves the same collision resistance.

Related papers

Efficient Algorithms for Quantum Hashing [0.0]
We present a circuit that implements the phase form of quantum hashing using $2n-1$ CNOT gates.<n>We also propose an algorithm that provides a trade-off between the number of CNOT gates and the precision of rotation angles.
arXiv Detail & Related papers (2025-07-09T16:32:15Z)
Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward [0.0]
Midcircuit measurement and feedforward have been shown to significantly reduce the depth of quantum circuits.<n>We propose several parallelization strategies that reduce quantum circuit depth at the expense of increasing width.
arXiv Detail & Related papers (2025-01-06T11:08:55Z)
Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions. The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z)
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)
A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
arXiv Detail & Related papers (2024-01-20T15:32:01Z)
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)
Tensor-network-assisted variational quantum algorithm [3.5995214208007944]
We present a framework for tensor-network-assisted variational quantum algorithms. We show that our approach consistently outperforms conventional methods using shallow quantum circuits.
arXiv Detail & Related papers (2022-12-20T16:59:54Z)
Multiqudit quantum hashing and its implementation based on orbital angular momentum encoding [0.0]
A new version of quantum hashing technique is developed wherein a quantum hash is constructed as a sequence of single-photon high-dimensional states (qudits) It is shown that the number of qudits decreases with increase of their dimension for an optimal ratio between collision probability and decoding probability of the hash.
arXiv Detail & Related papers (2022-10-19T12:18:02Z)
Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z)
Linear-depth quantum circuits for multiqubit controlled gates [3.0001636668817606]
We present a systematic procedure to decompose multiqubit controlled unitary gates. We show the advantage of our algorithm with proof-of-principle experiments on the IBM quantum cloud platform.
arXiv Detail & Related papers (2022-03-22T16:57:59Z)
Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
arXiv Detail & Related papers (2021-06-26T10:55:52Z)
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)

This list is automatically generated from the titles and abstracts of the papers in this site.