Related papers: A Quantum-Resistant Photonic Hash Function
We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed…
The aim of this paper is to develop novel quantum algorithms for Gaussian process quadrature methods. Gaussian process quadratures are numerical integration methods where Gaussian processes are used as functional priors for the integrands…
Boson Sampling represents a promising approach to obtain an evidence of the supremacy of quantum systems as a resource for the solution of computational problems. The classical hardness of Boson Sampling has been related to the so called…
Quantum mechanics promises computational powers beyond the reach of classical computers. Current technology is on the brink of an experimental demonstration of the superior power of quantum computation compared to classical devices. For…
As a promising candidate for exhibiting quantum computational supremacy, Gaussian Boson Sampling (GBS) is designed to exploit the ease of experimental preparation of Gaussian states. However, sufficiently large and inevitable experimental…
Quantum computer is no longer a hypothetical idea. It is the worlds most important technology and there is a race among countries to get supremacy in quantum technology. Its the technology that will reduce the computing time from years to…
Unsupervised fine-grained image hashing aims to learn compact binary codes that preserve subtle visual differences among highly similar instances without manual annotations. However, most existing methods neglect collision resistance,…
We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods. The complexity of the algorithm is exponential in the number of photon pairs detected, not the…
Due to the advances in the manufacturing of quantum hardware in the recent years, significant research efforts have been directed towards employing quantum methods to solving problems in various areas of interest. Thus a plethora of novel…
Quantum cryptography harnesses quantum light, in particular single photons, to provide security guarantees that cannot be reached by classical means. For each cryptographic task, the security feature of interest is directly related to the…
Boson sampling stands out as a promising approach toward experimental demonstration of quantum computational advantage. However, the presence of physical noise in near-term experiments hinders the realization of the quantum computational…
Boson sampling is expected to be one of an important milestones that will demonstrate quantum supremacy. The present work establishes the benchmarking of Gaussian boson sampling (GBS) with threshold detection based on the Sunway TaihuLight…
Combinatorial optimization problems pose significant computational challenges across various fields, from logistics to cryptography. Traditional computational methods often struggle with their exponential complexity, motivating exploration…
In the recent years, several practical methods have been published to compute collisions on some commonly used hash functions. In this paper we present a method to take into account, at the symbolic level, that an intruder actively…
Random point patterns are ubiquitous in nature, and statistical models such as point processes, i.e., algorithms that generate stochastic collections of points, are commonly used to simulate and interpret them. We propose an application of…
We introduce a complete description of a multi-mode bosonic quantum state in the coherent-state basis (which in this work is denoted as "$K$" function ), which---up to a phase---is the square root of the well-known Husimi "$Q$"…
The search for new, application-specific quantum computers designed to outperform any classical computer is driven by the ending of Moore's law and the quantum advantages potentially obtainable. Photonic networks are promising examples,…
We present two new constructions of quantum hash functions: the first based on expander graphs and the second based on extractor functions and estimate the amount of randomness that is needed to construct them. We also propose a keyed…
Gaussian boson sampling (GBS) has emerged as a promising quantum computing paradigm, demonstrating its potential in various applications. However, most existing works focus on theoretical aspects or simple tasks, with limited exploration of…
We propose a novel architecture for fault-tolerant quantum computing that incorporates strong single-photon nonlinearities into a photonic GHZ-measurement-based architecture. The nonlinearities substantially reduce resource overheads…