首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 171 毫秒
1.
This paper introduces graph-theoretic quantum system modelling (GTQSM), which is facilitated by considering the fundamental unit of quantum computation and information, viz. a quantum bit or qubit as a basic building block. Unit directional vectors ‘ket 0’ and ‘ket 1’ constitute two distinct fundamental quantum across variable orthonormal basis vectors (for the Hilbert space) specifying the direction of propagation, as it were, of information (or computation data) while complementary fundamental quantum through (flow rate) variables specify probability parameters (or amplitudes) as surrogates for scalar quantum information measure (von Neumann entropy). Applications of GTQSM are presented for quantum information/computation processing circuits ranging from a simple qubit and superposition or product of two qubits through controlled NOT and Hadamard gate operations to a substantive case of 3-port, 5-stage circuit for quantum teleportation. An illustrative circuit for teleporting a qubit is modelled as a complex ‘system of systems’ resulting in four probable transfer function models. It has the potential of extending the applications of GTQSM further to systems at the higher end of complexity scale too. The key contribution of this paper lies in generalization or extension of the graph-theoretic system modelling framework, hitherto used for classical (mostly deterministic) systems, to quantum random systems. Further extension of the graph-theoretic system modelling framework to quantum field modelling is the subject of future work.  相似文献   

2.
We study quantum teleportation between two different types of optical qubits using hybrid entanglement as a quantum channel under decoherence effects. One type of qubit employs the vacuum and single-photon states for the basis, called a single-rail single-photon qubit, and the other utilizes coherent states of opposite phases. We find that teleportation from a single-rail single-photon qubit to a coherent-state qubit is better than the opposite direction in terms of fidelity and success probability. We compare our results with those using a different type of hybrid entanglement between a polarized single-photon qubit and a coherent state.  相似文献   

3.
Quantum computation is becoming an important and effective tool to overcome the high real-time computational requirements of classical digital image processing. In this paper, based on analysis of existing quantum image representations, a novel enhanced quantum representation (NEQR) for digital images is proposed, which improves the latest flexible representation of quantum images (FRQI). The newly proposed quantum image representation uses the basis state of a qubit sequence to store the gray-scale value of each pixel in the image for the first time, instead of the probability amplitude of a qubit, as in FRQI. Because different basis states of qubit sequence are orthogonal, different gray scales in the NEQR quantum image can be distinguished. Performance comparisons with FRQI reveal that NEQR can achieve a quadratic speedup in quantum image preparation, increase the compression ratio of quantum images by approximately 1.5X, and retrieve digital images from quantum images accurately. Meanwhile, more quantum image operations related to gray-scale information in the image can be performed conveniently based on NEQR, for example partial color operations and statistical color operations. Therefore, the proposed NEQR quantum image model is more flexible and better suited for quantum image representation than other models in the literature.  相似文献   

4.
We theoretically investigate the implementation of the two-mode squeezing operator in circuit quantum electrodynamics. Inspired by a previous scheme for optical cavities (Prado et al. in Phys Rev A 73:043803, 2006), we employ a superconducting qubit coupled to two nondegenerate quantum modes and use a driving field on the qubit to adequately control the resonator–qubit interaction. Based on the generation of two-mode squeezed vacuum states, firstly we analyze the validity of our model in the ideal situation and then we investigate the influence of the dissipation mechanisms on the generation of the two-mode squeezing operation, namely the qubit and resonator mode decays and qubit dephasing. We show that our scheme allows the generation of highly squeezed states even with the state-of-the-art parameters, leading to a theoretical prediction of more than 10 dB of two-mode squeezing. Furthermore, our protocol is able to squeeze an arbitrary initial state of the resonators, which makes our scheme attractive for future applications in continuous-variable quantum information processing and quantum metrology in the realm of circuit quantum electrodynamics.  相似文献   

5.
Quantum circuit design flow consists of two main tasks: synthesis and physical design. Addressing the limitations imposed on optimization of the quantum circuit objectives because of no information sharing between synthesis and physical design processes, we introduced the concept of “physical synthesis” for quantum circuit flow and proposed a technique for it. Following that concept, in this paper we propose a new technique for physical synthesis using auxiliary qubit selection to improve the latency of quantum circuits. Moreover, it will be shown that the auxiliary qubit selection technique can be seamlessly integrated into the previously introduced physical synthesis flow. Our experimental results show that the proposed technique decreases the average latency objective of quantum circuits by about 11% for the attempted benchmarks.  相似文献   

6.
Concatenated Greenberger–Horne–Zeilinger (C-GHZ) state is a kind of logic qubit which is robust in noisy environment. In this paper, we encode the C-GHZ state as the logic qubit and design two kinds of quantum gates for such logic qubit. The first kind is the single logic-qubit gate which contains the logic-qubit bit-flip gate and phase-flip gate. The second kind is the logic-qubit controlled-not (CNOT) gate. We exploit the single quantum gate for physical qubit, such as bit-flip gate and phase-flip gate, and two-qubit CNOT gate to realize the logic-qubit gate. We also calculated the success probability of such logic-qubit gate based on the imperfect physical quantum gate. This protocol may be useful for future quantum computation.  相似文献   

7.
This paper presents a physical mapping tool for quantum circuits, which generates the optimal universal logic block (ULB) that can, on average, perform any logical fault-tolerant (FT) quantum operations with the minimum latency. The operation scheduling, placement, and qubit routing problems tackled by the quantum physical mapper are highly dependent on one another. More precisely, the scheduling solution affects the quality of the achievable placement solution due to resource pressures that may be created as a result of operation scheduling, whereas the operation placement and qubit routing solutions influence the scheduling solution due to resulting distances between predecessor and current operations, which in turn determines routing latencies. The proposed flow for the quantum physical mapper captures these dependencies by applying (1) a loose scheduling step, which transforms an initial quantum data flow graph into one that explicitly captures the no-cloning theorem of the quantum computing and then performs instruction scheduling based on a modified force-directed scheduling approach to minimize the resource contention and quantum circuit latency, (2) a placement step, which uses timing-driven instruction placement to minimize the approximate routing latencies while making iterative calls to the aforesaid force-directed scheduler to correct scheduling levels of quantum operations as needed, and (3) a routing step that finds dynamic values of routing latencies for the qubits. In addition to the quantum physical mapper, an approach is presented to determine the single best ULB size for a target quantum circuit by examining the latency of different FT quantum operations mapped onto different ULB sizes and using information about the occurrence frequency of operations on critical paths of the target quantum algorithm to weigh these latencies. Experimental results show an average latency reduction of about 40 % compared to previous work.  相似文献   

8.
实数编码量子进化算法   总被引:5,自引:0,他引:5  
为求解复杂函数优化问题,基于量子计算的相关概念和原理,提出一种实数编码量子进化算法.首先构造了由自变量向量的一个分量和量子比特的一对概率幅为等位基因的三倍体染色体,增加了解的多样性;然后利用量子旋转门和依据量子比特概率幅满足归一化条件设计的互补双变异算子进化染色体,实现局部搜索和全局搜索的平衡.标准函数仿真表明,该算法适合求解复杂函数优化问题,具有收敛速度快、全局搜索能力强和稳定性好的优点.  相似文献   

9.
如何更好地保护量子图像的版权,是量子水印技术的一个重要研究课题。基于对数极坐标的量子图像表示,提出了一种新颖的量子水印算法。根据通信双方共享一组密钥的值,发送方选择量子载体图像像素灰度值的高四位中的某一位作为受控位;再根据所选受控位的值,发送方将水印信息嵌入到量子载体图像的最低有效位或次最低有效位上。这种基于密钥的受控最低有效位修改技术,提高了量子水印图像的透明性和稳健性。基于MATLAB的实验仿真和性能分析,也表明新算法在透明性、稳健性和嵌入容量上有着良好的表现。  相似文献   

10.
We show that from a communication-complexity perspective, the primitive called oblivious transfer—which was introduced in a cryptographic context—can be seen as the classical analogue to a quantum channel in the same sense as non-local boxes are of maximally entangled qubits. More explicitly, one realization of non-cryptographic oblivious transfer allows for the perfect simulation of sending one qubit and measuring it in an orthogonal basis. On the other hand, a qubit channel allows for realizing non-cryptographic oblivious transfer with probability roughly 85 %, whereas 75 % is the classical limit.  相似文献   

11.
In this paper, a model for single photon amplification based on cluster-state quantum computation is proposed. A rescaling of the probability amplitudes of a deteriorated qubit in favor of the one-photon component will define the amplifier’s gain. Unlike the heralded quantum amplifiers, the probabilistic success of the whole process will not depend on the successful detection of a heralding signal. Instead, the whole procedure will rely upon a single-qubit measurement, which is simpler compared to any two-qubit interaction gate in the heralded quantum amplifiers. The proposed model can be used as a qubit protector against propagation losses in long-distance quantum communication networks.  相似文献   

12.
We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a “global Hadamard operation”, i.e. apply a Hadamard operation to every qubit simultaneously. In this model, we discuss complexity bounds (lower-bounding the number of global Hadamard operations) for common quantum algorithms: we illustrate upper bounds for Shor’s Algorithm, and prove lower bounds for Grover’s Algorithm. We also use our formalism to display a gate that is neither quantum-universal nor classically simulable, on the assumption that Integer Factoring is not in BPP.  相似文献   

13.
In our previous works, we have introduced the concept of “physical synthesis” as a method to consider the mutual effects of quantum circuit synthesis and physical design. While physical synthesis can involve various techniques to improve the characteristics of the resulting quantum circuit, we have proposed two techniques (namely gate exchanging and auxiliary qubit selection) to demonstrate the effectiveness of the physical synthesis. However, the previous contributions focused mainly on the physical synthesis concept, and the techniques were proposed only as a proof of concept. In this paper, we propose a methodological framework for physical synthesis that involves all previously proposed techniques along with a newly introduced one (called auxiliary qubit insertion). We will show that the entire flow can be seen as one monolithic methodology. The proposed methodology is analyzed using a large set of benchmarks. Experimental results show that the proposed methodology decreases the average latency of quantum circuits by about 36.81 % for the attempted benchmarks.  相似文献   

14.
We propose a mechanism for quantum state transfer (QST) over a binary tree spin network on the basis of incomplete collapsing measurements. To this aim, we perform initially a weak measurement (WM) on the central qubit of the binary tree network where the state of our concern has been prepared on that qubit. After the time evolution of the whole system, a quantum measurement reversal (QMR) is performed on a chosen target qubit. By taking optimal value for the strength of QMR, it is shown that the QST quality from the sending qubit to any typical target qubit on the binary tree is considerably improved in terms of the WM strength. Also, we show that how high-quality entanglement distribution over the binary tree network is achievable by using this approach.  相似文献   

15.
We demonstrate a fashion of quantum channel combining and splitting, called polar quantum channel coding, to generate a quantum bit (qubit) sequence that achieves the symmetric capacity for any given binary input discrete quantum channels. The present capacity is achievable subject to input of arbitrary qubits with equal probability. The polarizing quantum channels can be well-conditioned for quantum error-correction coding, which transmits partially quantum data through some channels at rate one with the symmetric capacity near one but at rate zero through others.  相似文献   

16.
We have studied different quantum dynamics of superconducting nano-circuits with Josephson junctions. A dc SQUID, when it is strongly decoupled from the environment, demonstrates two-level and multilevel dynamics. We have realized a two qubits coupled circuit based on a dc SQUID in parallel with an asymmetric Cooper pair transistor (ACPT). The ACPT behaves as a charge qubit. Its asymmetry produces a strong tunable coupling with the dc SQUID which is used to realize entangled states between the two qubits and new read-out of the charge qubit based on adiabatic quantum transfer. We have measured the current–phase relations of different rhombi chains in the presence or absence of quantum fluctuations which confirm theoretical predictions.  相似文献   

17.
Visualizations have played a crucial role in helping quantum computing users explore quantum states in various quantum computing applications. Among them, Bloch Sphere is the widely-used visualization for showing quantum states, which leverages angles to represent quantum amplitudes. However, it cannot support the visualization of quantum entanglement and superposition, the two essential properties of quantum computing. To address this issue, we propose VENUS, a novel visualization for quantum state representation. By explicitly correlating 2D geometric shapes based on the math foundation of quantum computing characteristics, VENUS effectively represents quantum amplitudes of both the single qubit and two qubits for quantum entanglement. Also, we use multiple coordinated semicircles to naturally encode probability distribution, making the quantum superposition intuitive to analyze. We conducted two well-designed case studies and an in-depth expert interview to evaluate the usefulness and effectiveness of VENUS. The result shows that VENUS can effectively facilitate the exploration of quantum states for the single qubit and two qubits.  相似文献   

18.
We propose a model for a scalable quantum computing in the circuit quantum electrodynamics architecture. In the Kagome lattice of qubits, three qubits are connected to each other through a superconducting three-junction flux qubit at the vertices of the lattice. By controlling one of the three-Josephson-junction energies of the intervening flux qubit, we can achieve the circulator function that couples arbitrary pair of two qubits among three. This selective coupling enables the interaction between two nearest neighbor qubits in the Kagome lattice, and further the two-qubit gate operation between any pair of qubits in the whole lattice by performing consecutive nearest neighbor two-qubit gates.  相似文献   

19.
基于多链拓展编码方案的量子遗传算法   总被引:1,自引:0,他引:1  
为了提高量子遗传算法的性能,提出了一种基于多链拓展编码方案的量子遗传算法。根据编码方案,将每个量子位分解为多个并列的基因,有效地拓展了搜索空间;结合编码方案提出量子更新策略,并引入了动态调整旋转角机制对个体进行更新,使用量子非门变异策略实现量子变异。仿真实验中,分析了使用不同变异概率[0,0.1,…,0.9,1]时对算法性能的影响,对比了分别使用普通量子遗传算法、双链编码方案、三链编码方案以及四链编码方案的量子遗传算法在优化函数极值问题时算法的性能。实验结果证明,通过增加基因链可以显著提高算法的性能,多链拓展编码方案可以提高量子遗传算法的性能,是有效的。  相似文献   

20.
The usefulness of the recent experimentally realized six photon cluster state by C. Y. Lu et al. (Nature 3:91, 2007) is investigated for quantum communication protocols like quantum teleportation and quantum information splitting (QIS) and dense coding. We show that the present state can be used for the teleportation of an arbitrary two qubit state deterministically. Later, we devise two distinct protocols for the QIS of an arbitrary two qubit state among two parties. We construct sixteen orthogonal measurement basis on the cluster state, which will lock an arbitrary two qubit state among two parties. The capability of the state for dense coding is investigated and it is shown that one can send five classical bits by sending only three qubits using this state as a shared entangled resource. We finally show that this state can also be utilised in the remote state preparation of an arbitrary two qubit state.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号