Majorana fermions induced Fano resonance and fast-to-slow light in a hybrid semiconductor/superconductor ring device
We demonstrate theoretically the Fano resonance and the conversion from fast to slow light in a hybrid quantum dot (QD)–semiconductor/superconductor (S/S) ring device, where the QD is coupled to a pair of Majorana fermions (MFs) appearing in the ...
Hybrid Helmholtz machines: a gate-based quantum circuit implementation
Quantum machine learning has the potential to overcome problems that current classical machine learning algorithms face, such as large data requirements or long learning times. Sampling is one of the aspects of classical machine learning that ...
Simple analysis of security of the BB84 quantum key distribution protocol
A simple proof of security of the BB84 protocol is presented in this paper. The proof is achieved in an information-theoretic way without referring to the formalism of quantum error-correction codes. Two examples are presented and discussed, ...
Better quantum control does not imply better discrimination effect
Quantum feedback control (QFBC) and quantum feedforward control (QFFC) are two major techniques for protecting quantum states against decoherence. Based on this, Guo et al. proposed a scheme by combining the QFFC and the minimum-error ...
Separability of heterogeneous multipartite quantum systems using Bloch Vectors
Refining recent results, we propose an upper bound for the norms of Bloch Vectors for heterogeneous quantum systems containing an arbitrary number of qudits with possibly different numbers of levels. We also generalize recent approaches for ...
Quantum fast Poisson solver: the algorithm and complete and modular circuit design
The Poisson equation has applications across many areas of physics and engineering, such as the dynamic process simulation of ocean current. Here we present a quantum algorithm for solving Poisson equation, as well as a complete and modular ...
Construction of mutually unbiased maximally entangled bases in by using Galois rings
A review of quantum and hybrid quantum/classical blockchain protocols
Blockchain technology is facing critical issues of scalability, efficiency and sustainability. These problems are necessary to solve if blockchain is to become a technology that can be used responsibly. Useful quantum computers could potentially ...
Quantum algorithms for typical hard problems: a perspective of cryptanalysis
In typical well-known cryptosystem, the hardness of classical problems plays a fundamental role in ensuring its security. While, with the booming of quantum computation, some classical hard problems tend to be vulnerable when confronted with the ...
Semi-quantum private comparison based on Bell states
In this paper, we propose two semi-quantum private comparison (SQPC) protocols based on Bell states. With the help of a semi-honest quantum third party (TP), two classical users can compare the equality of their secrets without leaking them. That TP ...
Quantum renormalization of -norm and relative entropy of coherence in quantum spin chains
Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA
Clustering algorithms are used to classify the unlabeled data into a number of categories with polynomial time complexity. Quantum clustering algorithms are developed to improve the performance and to achieve higher gain. In this work, we ...
The construction of 7-qubit unextendible product bases of size ten
The construction of multiqubit unextendible product bases (UPBs) is an important problem in quantum information. We construct a 7-qubit UPB of size 10 by studying the unextendible orthogonal matrices. We apply our result to construct an 8-qubit ...
Resolution map in quantum computing: signal representation by periodic patterns
In this paper, a new concept of the resolution map is presented to extract periodic structures that compose the signal. The resolution map is described by using the frequency–time representation of the signal, which is known as the paired ...
Solving diner’s dilemma game, circuit implementation and verification on the IBM quantum simulator
Diner’s dilemma is a problem of interest to both economics and game theory. Here, we solve this problem for n = 4 (where n is the number of players) with quantum rules. We are able to remove the dilemma of diners between the Pareto optimal and ...
Controlling quantum coherence of a two-component Bose–Einstein condensate via an impurity atom
We propose a scheme to control quantum coherence of a two-component Bose–Einstein condensate (BEC) by a single impurity atom immersed in the BEC. We show that the single impurity atom can act as a single-atom valve (SAV) to control quantum ...