Quantum bit detector

An Unconditionally Secure Quantum Bit Commitment Protocol

This article describes a quantum bit commitment protocol, QBC1, based on entanglement destruction via forced measurements and proves its unconditional security.

Practical Quantum Bit Commitment Protocol

A quantum protocol for bit commitment the security of which is based on technological limitations on nondemolition measurements and long-term quantum memory is presented.

CUBIT: Capacitive qUantum BIT

In this letter, it is proposed that cryogenic quantum bits can operate based on the nonlinearity due to the quantum capacitance of two-dimensional Dirac materials, and in particular graphene. The anharmonicity of a typical superconducting quantum bit is calculated, and the sensitivity of quantum bit frequency and anharmonicity with respect to temperature are found. Reasonable estimates reveal that a careful fabrication process can reveal expected properties, putting the context of quantum computing hardware into new perspectives.

一种简单实用的量子比特承诺协议

A simple practical quantum bit commitment protocol

该研究提出一种实现难度与现有实用方案相当、但安全性更强的简单量子比特承诺协议，可在非完美绑定与隐藏条件下无限接近无条件完全安全。

On the Possibility of Unconditionally Secure Quantum Bit Commitment

This paper has been withdrawn by the author.

Quantum Bit Commitment from a Computation Bound

This paper is withdrawn. See quant-ph/9806031 for a discussion.

Quantum Bit Commitment in a Noisy Channel

Under rather general assumptions about the properties of a noisy quantum channel, a first quantum protocol is proposed which allows to implement the secret bit commitment with the probability arbitrarily close to unity.

Counterfactual Quantum Bit Commitment

We propose a framework of bit commitment protocol using a comparison scheme and present a compound comparison scheme based on counterfactual cryptography. Finally, we propose a counterfactual quantum bit commitment protocol. In security analysis, we give the proper security parameters for counterfactual quantum bit commitment and prove that intercept attack and intercept/resend attack are ineffective attack for our protocol. In addition, we explain that counterfactual quantum bit commitment protocol cannot be attacked with no-go theorem attack by current technology.

Unconditional security in quantum bit commitment

The commitment of bits between two mutually distrustful parties is a powerful cryptographic primitive with which many cryptographic objectives can be achieved. It is widely believed that unconditionally secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. Gaps in the proof of this impossibility theorem are found. An unconditionally secure bit commitment protocol utilizing anonymous quantum states and the no-clone theorem is presented below with a full security proof.

A Practical Quantum Bit Commitment Protocol

In this paper, we introduce a new quantum bit commitment protocol which is practically secure against entanglement attacks. A general cheating strategy is discussed and shown to be practically ineffective against the proposed approach.

Permanently Secure Quantum Bit Commitment from a Temporary Computation Bound

This paper has been withdrawn. See quant-ph/9806031 for a discussion.

A brief review on the impossibility of quantum bit commitment

The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau. Later the result was generalized by Mayers who showed that unconditionally secure bit commitment is impossible. A brief review on quantum bit…

Quantum bit string commitment protocol using polarization of mesoscopic coherent states

In this work, we propose a quantum bit string commitment protocol using polarization of mesoscopic coherent states. The protocol is described and its security against brute force and quantum cloning machine attack is analyzed.

Why there is no impossibility theorem on Secure Quantum Bit Commitment

The impossibility proof on unconditionally secure quantum bit commitment is critically reviewed. Different ways of obtaining secure protocols are indicated.

Multi-bit quantum random number generator from a single qubit quantum walk

We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle with the position space in the walk dynamics certifies high randomness in the system. Quantum walk in a position space of dimension $2^l+1$ ensures string of $(l+ 2)$-bits of random numbers from a single measurement. Bit commitment with the position space and control over the spread of the probability distribution in position space enable us with options to e…

Quantum Bit Error Avoidance

Qubit errors might be avoided by using the quantum Zeno effect to inhibit evolution.

CALA-n：一种利用布洛赫球方法、Clifford+T门和布局在IBM量子计算机上实现高成本效益的2位、3位、4位和5位门的量子库

CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts

本文提出基于布洛赫球和Clifford+T门的量子布局感知方法，构造2至5量子比特的高成本效益n位门，并证明其转译后量子成本始终低于标准n位门，可用于构建IBM量子计算机量子库。

Improved Quantum Cost for n-bit Toffoli Gates

We present an n-bit Toffoli gate quantum circuit based on the realization proposed by Barenco, where some of the Toffoli gates in their construction are replaced with Peres gates. This results in a significant cost reduction. Our main contribution is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m-96 elementary quantum gates and one garbage bit which is passed unchanged. This paper is a corrected and expanded version of our recent journal publication.

Quantum bit string sealing

Though it was proven that secure quantum sealing of a single classical bit is impossible in principle, here we propose an unconditionally secure quantum sealing protocol which seals a classical bit string. Any reader can obtain each bit of the sealed string with an arbitrarily small error rate, while reading the string is detectable. The protocol is simple and easy to be implemented. The possibility of using this protocol to seal a single bit in practical is also discussed.

Practically secure quantum bit commitment based on quantum seals

The relationship between the quantum bit commitment (QBC) and quantum seal (QS) is studied. It is elaborated that QBC and QS are not equivalent, but QS protocols satisfying a stronger unconditional security requirement can lead to an unconditionally secure QBC. In this sense, QS is strictly stronger than QBC in security requirements. Based on an earlier proposal on sealing a single bit, a feasible QBC protocol is also put forward, which is secure in practice even if the cheater has a strong quantum computational power.

Quantum key distribution with 2-bit quantum codes

We propose a prepare-and-measure scheme for quantum key distribution with 2-bit quantum codes. The protocol is unconditionally secure under whatever type of intercept-and-resend attack. Given the symmetric and independent errors to the transmitted qubits, our scheme can tolerate a bit error rate up to 26% in 4-state protocol and 30% in 6-state protocol, respectively. These values are higher than all currently known threshold values for prepare-and-measure protocols. A specific realization with linear optics is given.

QBC3: An Unconditionally Secure Quantum Bit Commitment Protocol

This article describes a quantum bit commitment protocol, QBC3, based on entanglement destruction via forced measurements and proves its unconditional security. Some comments on the current status of the field are also made.

A role of antiquantum bits for superdense coding and quantum computing

We define an anti-quantum bit state via analogous way as the anti-state in Particle Physics.We show the quantum information Feymann diagrams for the teleportations and superdense coding, which preserve the information flow. The role of information vacuum and anihilation between error information and anti-information is mentioned for the stability of quantum computing.

Single-shot number-resolved detection of microwave photons with error mitigation

Single-photon detectors are ubiquitous and integral components of photonic quantum cryptography, communication, and computation. Many applications, however, require not only detecting the presence of any photons, but distinguishing the number present with a single shot. Here, we implement a single-shot, high-fidelity photon number-resolving detector of up to 15 microwave photons in a cavity-qubit circuit QED platform. This detector functions by measuring a series of generalized parity operators which make up the bits in the binary decomposition of the photon number. Our protocol consists of su…

Quantum Bit Commitment Using Entangled States

Based on the fact that the entanglement can not be created locally, we proposed a quantum bit commitment protocol, in which entangled states and quantum algorithms is used. The bit is not encoded with the form of the quantum states, and delaying the measurement is required. Therefore the protocol will not be denied by the Mayers-Lo-Chau no-go theorem, and unconditional security is achieved.

Multi-bit quantum digital signature based on quantum temporal ghost imaging

Digital signature scheme is commonly employed in modern electronic commerce and quantum digital signature (QDS) offers the information-theoretical security by the laws of quantum mechanics against attackers with unreasonable computation resources. The focus of previous QDS was on the signature of 1-bit message. In contrast, based on quantum ghost imaging with security test, we propose a scheme of QDS in which a multi-bit message can be signed at a time. Our protocol is no more demanding than the traditional cases for the requirements of quantum resources and classical communications. The multi…

Quantum bit commitment with cheat sensitive binding and approximate sealing

This paper proposes a cheat sensitive quantum bit commitment (CSQBC) scheme based on single photons, in which Alice commits a bit to Bob. Here, Bob only can cheat the committed bit with probability close to $0$ with the increasing of used single photons' amount. And if Alice altered her committed bit after commitment phase, she will be detected with probability close to $1$ with the increasing of used single photons' amount. The scheme is easy to be realized with nowadays technology.

A Universal Two--Bit Gate for Quantum Computation

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit gate.

Secure Ping-Pong quantum key distribution protocol with 33.3% bit error rate

This paper has been withdrawn and replaced by quant-ph/0609207.

Insecurity Of Imperfect Quantum Bit Seal

Quantum bit seal is a way to encode a classical bit quantum mechanically so that everyone can obtain non-zero information on the value of the bit. Moreover, such an attempt should have a high chance of being detected by an authorized verifier. Surely, a reader looks for a way to get the maximum amount of information on the sealed bit and at the same time to minimize her chance of being caught. And a verifier picks a sealing scheme that maximizes his chance of detecting any measurement of the sealed bit. Here, I report a strategy that passes all measurement detection procedures at least half of…

Impossibility Proofs and Quantum Bit Commitment

The nature and scope of various impossibility proofs as they relate to real-world situations are discussed. In particular, it is shown in words without technical symbols how secure quantum bit commitment protocols may be obtained with testing that exploits the multiple possibilities of cheating entanglement formation.

Is Quantum Bit Commitment Really Impossible?

This paper has been withdrawn.

Realization of a 5-bit NMR Quantum Computer Using a New Molecular Architecture

We demonstrate a five-bit nuclear-magnetic-resonance quantum computer that distinguishes among various functions on four bits, making use of quantum parallelism. Its construction draws on the recognition of the sufficiency of linear coupling along a chain of nuclear spins, the synthesis of a suitably coupled molecule, and the use of a multi-channel spectrometer.

Comment on "A short impossibility proof of quantum bit commitment"

In a recent letter (Phys. Lett. A 377 (2013) 1076, arXiv:0905.3801), the authors presented an impossibility proof of quantum bit commitment, which attempted to cover all possible protocols that involve both quantum and classical information. Here we show that there are many errors in the proof, thus it fails to exhaust all conceivable protocols.

Considerations about the randomness of bit strings originated from sequences of integer numbers according to a simple quantum computer model

This work uses a simple quantum computer model to discuss the randomness of bit strings originated from integer sequences. The considered quantum computer model has three elements: a processing unit responsible for a mathematical operation, an initial equally weighted superposition and a quantum state used as resource. The randomness depends on the last.

Quantum Zero-Knowledge Protocol Using Quantum Bit Commitment without Quantum Memory

Zero-knowledge proof system is an important protocol that can be used as a basic block for construction of other more complex cryptographic protocols. Quantum zero-knowledge protocols have been proposed but, since their implementation requires advanced quantum technology devices, experimental implementation of zero-knowledge protocols have not being reported. In this work, we present a quantum zero-knowledge protocol based on a quantum bit commitment protocol that can be implemented with today technology. Hence, our quantum zero-knowledge protocol can be readily implemented.

How to Build Unconditionally Secure Quantum Bit Commitment Protocols

The ``impossibility proof'' on unconditionally secure quantum bit commitment is critically analyzed. Many possibilities for obtaining a secure bit commitment protocol are indicated, purely on the basis of two-way quantum communications, which are not covered by the impossibility proof formulation. They are classified under six new types of protocols, with security proofs for specific examples on four types. Reasons for some previously failed attempts at obtaining secure protocols are also indicated.

一种基于布洛赫球方法的几何设计工具，用于构建成本效益高的布局感知n位量子门

A Geometrical Design Tool for Building Cost-Effective Layout-Aware n-Bit Quantum Gates Using the Bloch Sphere Approach

本文提出基于布洛赫球的几何设计方法，用于构建低成本的n位量子门，通过可视化几何交集替代传统矩阵乘法，降低量子成本。

Quantum filtering one bit at a time

In this paper we consider the purification of a quantum state using the information obtained from a continuous measurement record, where the classical measurement record is digitized to a single bit per measurement after the measurements have been made. Analysis indicates that efficient and reliable state purification is achievable for one- and two-qubit systems. We also consider quantum feedback control based on the discrete one-bit measurement sequences.

Quantum Bit Commitment Combinbing with BB84 Protocol

We proposed a new quantum bit commitment scheme in which secret key need not to be provided by other quantum key distribution system. We can get the bit commitment with probability p by adding a waiting time in a frame during operating the BB84 protocol. Then the measurement outcomes can be encrypted by one-time pad with the key generated by BB84 protocol. We can also obtain the redundant secret keys to encrypt other information in this quantum key distribution system.

The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $ρ_0^{(n)}$ and $ρ_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string i…

Optimal bounds for quantum bit commitment

Bit commitment is a fundamental cryptographic primitive with numerous applications. Quantum information allows for bit commitment schemes in the information theoretic setting where no dishonest party can perfectly cheat. The previously best-known quantum protocol by Ambainis achieved a cheating probability of at most 3/4[Amb01]. On the other hand, Kitaev showed that no quantum protocol can have cheating probability less than 1/sqrt{2} [Kit03] (his lower bound on coin flipping can be easily extended to bit commitment). Closing this gap has since been an important and open question. In this pape…

The physics of no-bit-commitment : Generalized quantum non-locality versus oblivious transfer

We show here that the recent work of Wolf and Wullschleger (quant-ph/0502030) on oblivious transfer apparently opens the possibility that non-local correlations which are stronger than those in quantum mechanics could be used for bit-commitment. This is surprising, because it is the very existence of non-local correlations which in quantum mechanics prevents bit-commitment. We resolve this apparent paradox by stressing the difference between non-local correlations and oblivious transfer, based on the time-ordering of their inputs and outputs, which prevents bit-commitment.

Anonymous-key quantum cryptography and unconditionally secure quantum bit commitment

A new cryptographic tool, anonymous quantum key technique, is introduced that leads to unconditionally secure key distribution and encryption schemes that can be readily implemented experimentally in a realistic environment. If quantum memory is available, the technique would have many features of public-key cryptography; an identification protocol that does not require a shared secret key is provided as an illustration. The possibility is also indicated for obtaining unconditionally secure quantum bit commitment protocols with this technique.

Perfect Secure High-Dimensional Quantum Bit Commitment Protocol

This paper has been withdrawn due to security loophole. We thank Dr G. P. he for pointing this to us.

The existance of unconditionally secure quantum bit commitment

This paper has been withdrawn by the author(s).The scheme presented is insecure.

Unconditionally Secure Quantum Bit Commitment Is Possible

Bit commitment involves the submission of evidence from one party to another so that the evidence can be used to confirm a later revealed bit value by the first party, while the second party cannot determine the bit value from the evidence alone. It is widely believed that secure quantum bit commitment is impossible due to quantum entanglement cheating, which is codified in a general impossibility theorem. In this paper, the scope of this general impossibility proof is extended and analyzed, and gaps are found. Three specific protocols are described for which the entanglement cheating as given…

Why quantum bit commitment and ideal quantum coin tossing are impossible

There had been well known claims of ``provably unbreakable'' quantum protocols for bit commitment and coin tossing. However, we, and independently Mayers, showed that all proposed quantum bit commitment (and therefore coin tossing) schemes are, in principle, insecure because the sender, Alice, can always cheat successfully by using an EPR-type of attack and delaying her measurements. One might wonder if secure quantum bit commitment and coin tossing protocols exist at all. Here we prove that an EPR-type of attack by Alice will, in principle, break {\em any} realistic quantum bit commitment and…

Defeating classical bit commitments with a quantum computer

It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to perform a measurement. Similar situations had been encountered previously in the design of Quantum Oblivious Transfer. The question is whether a classical bit commitment could be used for this specific purpose. We demonstrate that, surprisingly, classical unconditionally concealing bit commitments do not help.

Complete Characterization of a Quantum Process: the Two-Bit Quantum Gate

We show how to fully characterize a quantum process in an open quantum system. We particularize the procedure to the case of a universal two-qubit gate in a quantum computer. We illustrate the method with a numerical simulation of a quantum gate in the ion trap quantum computer.

A simple unconditionally secure quantum bit commitment protocol via quantum teleportation

By using local quantum teleportation of a fixed state to one qubit of an entangled pair sent from the other party, it is shown how one party can commit a bit with only classical information as evidence that results in an unconditionally secure protocol. The well-known ``impossibility proof'' does not cover such protocols due to its different commitment and opening prescriptions, which necessitate actual quantum measurements among different possible systems that cannot be entangled as a consequence.

Non-Randomness of Google's Quantum Supremacy Benchmark

The first achievement of quantum supremacy has been claimed recently by Google for the random quantum circuit benchmark with 53 superconducting qubits. Here, we analyze the randomness of Google's quantum random-bit sampling. The heat maps of Google's random bit-strings show stripe patterns at specific qubits in contrast to the Haar-measure or classical random-bit strings. Google's data contains more bit 0 than bit 1, i.e., about 2.8\% difference, and fail to pass the NIST random number tests, while the Haar-measure or classical random-bit samples pass. Their difference is also illustrated by t…

Quantum bit commitment under Gaussian constraints

Quantum bit commitment has long been known to be impossible. Nevertheless, just as in the classical case, imposing certain constraints on the power of the parties may enable the construction of asymptotically secure protocols. Here, we introduce a quantum bit commitment protocol and prove that it is asymptotically secure if cheating is restricted to Gaussian operations. This protocol exploits continuous-variable quantum optical carriers, for which such a Gaussian constraint is experimentally relevant as the high optical nonlinearity needed to effect deterministic non-Gaussian cheating is inacc…

Comment on ``Testing integrability with a single bit of quantum information''

In quant-ph/0303042, Poulin, Laflamme, Milburn and Paz consider the problem of distinguishing quantum chaos from quantum integrability for dynamics in an $N$-dimensional Hilbert space. They claim that this can be done by deterministic quantum computing with a single bit using $O(\sqrt{N})$ physical resources, compared to O(N) physical resources classically. I point out what seems to be a fatal flaw with their proposal.