相关论文: VDOO: A Short, Fast, Post-Quantum Multivariate Dig…
Quantum digital signatures (QDSs) promise information-theoretic security against repudiation and forgery of messages. Compared with currently existing three-party QDS protocols, multiparty protocols have unique advantages in the practical…
We propose and analyze a set of variational quantum algorithms for solving quadratic unconstrained binary optimization problems where a problem consisting of $n_c$ classical variables can be implemented on $\mathcal O(\log n_c)$ number of…
We propose a gate optimization method, which we call variational quantum gate optimization (VQGO). VQGO is a method to construct a target multi-qubit gate by optimizing a parametrized quantum circuit which consists of tunable single-qubit…
The Worldvolume Hybrid Monte Carlo (WV-HMC) method [arXiv:2012.08468] is an efficient algorithm for addressing the numerical sign problem at moderate computational cost. It mitigates the sign problem while avoiding the ergodicity issues…
Shor's algorithm efficiently solves factoring and discrete logarithm problems using quantum computers, compromising all public key schemes used today. These schemes rely on assumptions on their computational complexity, which quantum…
Current universal quantum computers have a limited number of noisy qubits. Because of this, it is difficult to use them to solve large-scale complex optimization problems. In this paper we tackle this issue by proposing a quantum…
We introduce DOMINO, a light-matter computing platform that exploits the full complex amplitude of coupled condensate networks to solve maximum-weight clique problems and reveal hidden indirect correlations in large graphs. By embedding…
Quantum Monte Carlo (QMC) methods offer exact solutions for quantum many-body systems but face severe limitations in fermionic systems like atomic nuclei due to the sign problem. While sign-problem-free QMC algorithms exist and provide…
While current network intrusion detection systems achieve satisfactory accuracy, they often lack explainability. Subgroup Discovery (SD) addresses this by building interpretable rules that characterize feature interactions associated with…
Over the last few decades, numerous LiDAR-inertial odometry (LIO) algorithms have been developed, demonstrating satisfactory performance across diverse environments. Most of these algorithms have predominantly been validated in open outdoor…
We investigate a quadratic unconstrained binary optimization (QUBO) formulation of the graph isomorphism problem using the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE). For small graph…
Many differentially private and classical non-private graph algorithms rely crucially on determining whether some property of each vertex meets a threshold. For example, for the $k$-core decomposition problem, the classic peeling algorithm…
As an intrinsically unbiased method, the quantum Monte Carlo (QMC) method is of unique importance in simulating interacting quantum systems. Although the QMC method often suffers from the notorious sign problem, the sign problem of quantum…
Recent advances in the development of commercial quantum annealers such as the D-Wave 2X allow solving NP-hard optimization problems that can be expressed as quadratic unconstrained binary programs. However, the relatively small number of…
Many real-world problems, like modelling environment dynamics, physical processes, time series etc., involve solving Partial Differential Equations (PDEs) parameterised by problem-specific conditions. Recently, a deep learning architecture…
Digital signal processing technology has paved the way for the realization of high-speed continuous-variable quantum key distribution systems. However, existing security proofs are limited to static digital signal processing algorithms,…
To achieve accurate and robust pose estimation in Simultaneous Localization and Mapping (SLAM) task, multi-sensor fusion is proven to be an effective solution and thus provides great potential in robotic applications. This paper proposes…
Post-quantum cryptography currently rests on a small number of hardness assumptions, posing significant risks should any one of them be compromised. This vulnerability motivates the search for new and cryptographically versatile assumptions…
The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor's work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical…
As the quantum computing ecosystem grows in popularity and utility it is important to identify and address the security and privacy vulnerabilities before they can be widely exploited. One major concern is the involvement of third party…