Search

Quantum computation offers unique properties that cannot be paralleled by conventional computers. In particular, reading qubits may change their state and thus signal the presence of an intruder. This paper develops a proof-of-concept for a quantum honeypot that allows the detection of intruders on reading. The idea is to place quantum sentinels within all resources offered within the honeypot. Additional to classical honeypots, honeypots with quantum sentinels can trace the reading activity of the intruder within any resource. Sentinels can be set to be either visible and accessible to the intruder or hidden and unknown to intruders. Catching the intruder using quantum sentinels has a low theoretical probability per sentinel, but the probability can be increased arbitrarily higher by adding more sentinels. The main contributions of this paper are that the monitoring of the intruder can be carried out at the level of the information unit, such as the bit, and quantum monitoring activity is fully hidden from the intruder. Practical experiments, as performed in this research, show that the error rate of quantum computers has to be considerably reduced before implementations of this concept are feasible. [ABSTRACT FROM AUTHOR]

Squiggle data is the numerical output of DNA and RNA sequencing by the Nanopore next generation sequencing platform. Nanopore sequencing offers expanded applications compared to previous sequencing techniques but produces a large amount of data in the form of current measurements over time. The analysis of these segments of current measurements require more complex and computationally intensive algorithms than previous sequencing technologies. The purpose of this study is to investigate in principle the potential of using quantum computers to speed up Nanopore data analysis. Quantum circuits are designed to extract major features of squiggle current measurements. The circuits are analyzed theoretically in terms of size and performance. Practical experiments on IBM QX show the limitations of the state of the art quantum computer to tackle real life squiggle data problems. Nevertheless, pre-processing of the squiggle data using the inverse wavelet transform, as experimented and analyzed in this paper as well, reduces the dimensionality of the problem in order to fit a reasonable size quantum computer in the hopefully near future. [ABSTRACT FROM AUTHOR]

This paper studies the effect of quantum computers on Bitcoin mining. The shift in computational paradigm towards quantum computation allows the entire search space of the golden nonce to be queried at once by exploiting quantum superpositions and entanglement. Using Grover's algorithm, a solution can be extracted in time O ( 2 256 / t) , where t is the target value for the nonce. This is better using a square root over the classical search algorithm that requires O (2 256 / t) tries. If sufficiently large quantum computers are available for the public, mining activity in the classical sense becomes obsolete, as quantum computers always win. Without considering quantum noise, the size of the quantum computer needs to be ≈ 10 4 qubits. [ABSTRACT FROM AUTHOR]

Quantum bit commitment (QBC) is a quantum version of the classical bit commitment security primitive. As other quantum security primitives and protocols, QBC improves on cheating detection over its classical counterpart. The implementation of the QBC protocol below relies on the use of common quantum gates: the Hadamard gate used for orthonormal bases and the CNOT gate used to swap qubits. The protocol was run and tested on IBM quantum experience (IBM QX). IBM QX offers two different quantum environments: as a simulator and as a real quantum machine. In our implementation, honest and dishonest participants were considered. Results of both the simulation and the quantum execution were compared against the theoretical expectations. The IBM QX simulator gives results that match the theoretical model. The IBM QX real computer deviates from the expected behavior by a measurable amount. Using the standard deviation and the Hamming distance, the conclusion is that the quantum computer is usable as the difference to the simulator is within an acceptable margin of error. The QBC protocol of choice is fully secure against cheating by Bob. The only way Alice can cheat is using multi-dimensional entanglement. The cost for Alice to cheat is exponential in the number of qubits used, namely O (2 6 n + 3 k + 1) . [ABSTRACT FROM AUTHOR]

Together with bit commitment, Oblivious Transfer is a very useful cryptographic primitive with important applications, most notably in secure multiparty computations. It has been long known that secure Quantum Oblivious Transfer can be achieved from a secure implementation of Quantum Bit Commitment. Unfortunately, it is also well known that unconditionally secure Quantum Bit Commitment is impossible, so building a secure Oblivious Transfer protocol on top of Quantum Bit Commitment is ruled out. In this paper, we propose a relatively simple quantum protocol for Oblivious Transfer which does not require qubit storage, does not rely on bit commitment as a primitive and is easily implementable with current technology, if the two actors are honest. The protocol is proven to be secure against any individual measurements and entanglement-based attacks. Any cheating attempt trying to speculate collective measurements would be considerably difficult to put in practice, even in the near future. Furthermore, the number of qubits used in our scheme (embodied as photons in a physical realization of the protocol) acts as a security parameter, making it increasingly hard to cheat. [ABSTRACT FROM AUTHOR]

The quantum model of computation not only offers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genuine quantum mechanical terms. We show that the task of distinguishing among entangled quantum states combines entanglement and non-determinism in a way that makes the quantum solution impossible to simulate on any classical machine (even one equipped with the same measurement capabilities as the quantum computational device). A new class of information processing tasks is thus uncovered whose members are readily carried out by a quantum computer, yet are impossible to perform on any classical machine (whether deterministic or probabilistic). In the broad, unconventional context created by quantum mechanics, the computational power of a quantum computer is therefore strictly greater than that of a classical computer. [ABSTRACT FROM AUTHOR]