Related papers: Experimental Cryptographic Verification for Near-T…
Quantum computers pose a fundamental threat to widely deployed public-key cryptosystems, such as RSA and ECC, by enabling efficient integer factorization using Shor's algorithm. Theoretical resource estimates suggest that 2048-bit RSA keys…
Quantum systems, in general, output data that cannot be simulated efficiently by a classical computer, and hence is useful for solving certain mathematical problems and simulating quantum many-body systems. This also implies, unfortunately,…
The proliferation of cloud computing technologies has paved the way for deploying networked encrypted control systems, offering high performance, remote accessibility and privacy. However, in scenarios where the control algorithms run on…
A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior, under certain cryptographic assumptions. Recent attempts to implement such tests on current…
Quantum computers are the promising candidates for simulation of large quantum systems, which is a daunting task to perform in a classical computer. Here, we report the experimental realization of quantum tunneling of a single particle…
Quantum computing exploits fundamentally new models of computation based on quantum mechanical properties instead of classical physics, and it is believed that quantum computers are able to dramatically improve computational power for…
A fully homomorphic encryption system hides data from unauthorized parties, while still allowing them to perform computations on the encrypted data. Aside from the straightforward benefit of allowing users to delegate computations to a more…
Quantum computing (QC) has the potential to revolutionize fields like machine learning, security, and healthcare. Quantum machine learning (QML) has emerged as a promising area, enhancing learning algorithms using quantum computers.…
This research note II introduces a way to understand a basic concept of the quantum enigma cipher. The conventional cipher is designed by a mathematical algorithm and its security is evaluated by the complexity of the algorithm in security…
The notion of compressed quantum computation is employed to simulate the Ising interaction of a 1D--chain consisting out of $n$ qubits using the universal IBM cloud quantum computer running on $\log(n)$ qubits. The external field parameter…
Near-term quantum computers have been built as intermediate-scale quantum devices and are fragile against quantum noise effects, namely, NISQ devices. Traditional quantum-error-correcting codes are not implemented on such devices and to…
We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…
The use of quantum computing for machine learning is among the most promising applications of quantum technologies. Quantum models inspired by classical algorithms are developed to explore some possible advantages over classical approaches.…
The emergence of noisy intermediate-scale quantum (NISQ) computers has important consequences for cryptographic algorithms. It is theoretically well-established that key algorithms used in cybersecurity are vulnerable to quantum computers…
Given a ciphertext, is it possible to prove the deletion of the underlying plaintext? Since classical ciphertexts can be copied, clearly such a feat is impossible using classical information alone. In stark contrast to this, we show that…
Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…
Noise causes severe difficulties in implementing quantum computing and quantum cryptography. Several schemes have been suggested to reduce this problem, mainly focusing on quantum computation. Motivated by quantum cryptography, we suggest a…
The widely held belief that BQP strictly contains BPP raises fundamental questions: Upcoming generations of quantum computers might already be too large to be simulated classically. Is it possible to experimentally test that these systems…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
We propose an efficient quantum protocol performing quantum bit commitment, which is a simple cryptographic primitive involved with two parties, called a committer and a verifier. Our protocol is non-interactive, uses no supplemental shared…