Quantum hashing via single-photon states with orbital angular momentum
- URL: http://arxiv.org/abs/2110.08535v1
- Date: Sat, 16 Oct 2021 10:02:01 GMT
- Title: Quantum hashing via single-photon states with orbital angular momentum
- Authors: D.A. Turaykhanov, D.O. Akat'ev, A.V. Vasiliev, F.M. Ablayev, A.A.
Kalachev
- Abstract summary: We construct a quantum hash via a sequence of single-photon states and perform a proof-of-principle experiment.
We experimentally verify the collision resistance of the quantum hash function depending on the number of qubits in use.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum hashing is a promising generalization of the cryptographic hashing
concept on the quantum domain. In this paper, we construct a quantum hash via a
sequence of single-photon states and perform a proof-of-principle experiment
using orbital angular momentum (OAM) encoding. We experimentally verify the
collision resistance of the quantum hash function depending on the number of
qubits in use. Based on these results, we conclude that theoretical estimates
are confirmed for different bases of OAM states and the proposed technique can
be useful in computational and cryptographic scenarios. The possibility of
multiplexing different OAM bases can make this approach even more efficient.
Related papers
- 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 Bottom-up Approach to Constructing Symmetric Variational Quantum
Circuits [0.0]
We show how to construct symmetric quantum circuits using representation theory.
We show how to derive the particle-conserving exchange gates, which are commonly used in constructing hardware-efficient quantum circuits.
arXiv Detail & Related papers (2023-08-17T10:57:15Z) - 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) - Simple Tests of Quantumness Also Certify Qubits [69.96668065491183]
A test of quantumness is a protocol that allows a classical verifier to certify (only) that a prover is not classical.
We show that tests of quantumness that follow a certain template, which captures recent proposals such as (Kalai et al., 2022) can in fact do much more.
Namely, the same protocols can be used for certifying a qubit, a building-block that stands at the heart of applications such as certifiable randomness and classical delegation of quantum computation.
arXiv Detail & Related papers (2023-03-02T14:18:17Z) - 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) - Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle.
We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm.
We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Automatic quantum circuit encoding of a given arbitrary quantum state [0.0]
We propose a quantum-classical hybrid algorithm to encode a given arbitrarily quantum state onto an optimal quantum circuit.
The proposed algorithm employs as an objective function the absolute value of fidelity $F = langle 0 vert hatmathcalCdagger vert Psi rangle$.
We experimentally demonstrate that a quantum circuit generated by the AQCE algorithm can indeed represent the original quantum state reasonably on a noisy real quantum device.
arXiv Detail & Related papers (2021-12-29T12:33:41Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Continuous Variable Quantum Advantages and Applications in Quantum
Optics [0.0]
This thesis focuses on three main questions in the continuous variable and optical settings.
Where does a quantum advantage, that is, the ability of quantum machines to outperform classical machines, come from?
What advantages can be gained in practice from the use of quantum information?
arXiv Detail & Related papers (2021-02-10T02:43:27Z) - Quantum Search for Scaled Hash Function Preimages [1.3299507495084417]
We present the implementation of Grover's algorithm in a quantum simulator to perform a quantum search for preimages of two scaled hash functions.
We show that strategies that suggest a shortcut based on sampling the quantum register after a few steps of Grover's algorithm can only provide some marginal practical advantage in terms of error mitigation.
arXiv Detail & Related papers (2020-09-01T18:00:02Z)
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.