共查询到20条相似文献,搜索用时 15 毫秒
1.
量子计算和量子模拟在过去的几年里发展迅速,今后涉及多量子比特的量子计算和量子模拟将是一个发展的重点.本文回顾了该领域的主要进展,包括量子多体模拟、量子计算、量子计算模拟器、量子计算云平台、量子软件等内容,其中量子多体模拟又涵盖量子多体动力学、时间晶体及多体局域化、量子统计和量子化学等的模拟.这些研究方向的回顾是基于对现阶段量子计算和量子模拟研究特点的考虑,即量子比特数处于中等规模而量子操控精度还不具有大规模逻辑门实现的能力,研究处于基础科研和实用化的过渡阶段,因此综述的内容主要还是希望管窥今后的发展. 相似文献
2.
In the past years, great progresses have been made on quantum computation and quantum simulation. Increasing the number of qubits in the quantum processors is expected to be one of the main motivations in the next years, while noises in manipulation of quantum states may still be inevitable even the precision will improve. For research in this direction, it is necessary to review the available results about noisy multiqubit quantum computation and quantum simulation. The review focuses on multiqubit state generations, quantum computational advantage, and simulating physics of quantum many-body systems. Perspectives of near term noisy intermediate-quantum processors will be discussed. 相似文献
3.
We analyze the problem of a quantum computer in a correlated environment protected from decoherence by quantum error correction using a perturbative renormalization group approach. The scaling equation obtained reflects the competition between the dimension of the computer and the scaling dimension of the correlations. For an irrelevant flow, the error probability is reduced to a stochastic form for a long time and/or a large number of qubits; thus, the traditional derivation of the threshold theorem holds for these error models. In this way, the "threshold theorem" of quantum computing is rephrased as a dimensional criterion. 相似文献
4.
We present a classical protocol, using the matrix product-state representation, to simulate cluster-state quantum computation at a cost polynomial in the number of qubits in the cluster and exponential in d---the width of the cluster. We use this result to show that any log-depth quantum computation in the gate array model, with gates linking only nearby qubits, can be simulated efficiently on a classical computer. 相似文献
5.
Quantum information processing based on Rydberg atoms emerged as a promising direction two decades ago.Recent experimental and theoretical progresses have shined exciting light on this avenue.In this concise review,we will briefly introduce the basics of Rydberg atoms and their recent applications in associated areas of neutral atom quantum computation and simulation.We shall also include related discussions on quantum optics with Rydberg atomic ensembles,which are increasingly used to explore quantum computation and quantum simulation with photons. 相似文献
6.
《Comptes Rendus Physique》2016,17(7):778-787
The development of quantum Josephson circuits has created a strong expectation for reliable processing of quantum information. While this progress has already led to various proof-of-principle experiments on small-scale quantum systems, a major scaling step is required towards many-qubit protocols. Fault-tolerant computation with protected logical qubits usually comes at the expense of a significant overhead in the hardware. Each of the involved physical qubits still needs to satisfy the best achieved properties (coherence times, coupling strengths and tunability). Here, and in the aim of addressing alternative approaches to deal with these obstacles, I overview a series of recent theoretical proposals, and the experimental developments following these proposals, to enable a hardware-efficient paradigm for quantum memory protection and universal quantum computation. 相似文献
7.
In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particlelike excitations (quasiparticles) around one another in two space dimensions. The resulting quasiparticle trajectories define world lines in three-dimensional space-time, and the corresponding quantum gates depend only on the topology of the braids formed by these world lines. We show how to find braids that yield a universal set of quantum gates for qubits encoded using a specific kind of quasiparticle which is particularly promising for experimental realization. 相似文献
8.
We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with 8 < or = d < or = 32. Each system serves to store one logical qubit and additional auxiliary dimensions are used to create and purify entanglement between systems. Physical, possibly probabilistic two-system operations with error rates up to 2/3 are still tolerable to realize deterministic high-quality two-qubit gates on the logical qubits. The achievable error rate is of the same order of magnitude as of the single-system operations. We investigate possible implementations of our scheme for several physical setups. 相似文献
9.
It is well known that the quantum Zeno effect can protect specific quantum states from decoherence by using projective measurements. Here we combine the theory of weak measurements with stabilizer quantum error correction and detection codes. We derive rigorous performance bounds which demonstrate that the Zeno effect can be used to protect appropriately encoded arbitrary states to arbitrary accuracy while at the same time allowing for universal quantum computation or quantum control. 相似文献
10.
11.
We introduce ways to measure information storage in quantum systems, using a recently introduced computation-theoretic model that accounts for measurement effects. The first, the quantum excess entropy, quantifies the shared information between a quantum process's past and its future. The second, the quantum transient information, determines the difficulty with which an observer comes to know the internal state of a quantum process through measurements. We contrast these with von Neumann entropy and quantum entropy rate and provide a closed-form expression for the latter for the class of deterministic quantum processes. 相似文献
12.
13.
14.
《Physics letters. A》2005,336(1):71-75
We characterize a niobium-based vertical Josephson interferometer which we propose to include in a superconducting loop for applications to quantum computation using flux qubits. The most interesting feature of this device is that the Josephson current is precisely modulated by a small transversal magnetic field parallel to superconducting loop plane from a maximum to zero, with fine control and precision. This device can be used to independently control the off-diagonal Hamiltonian terms of flux qubits and/or to control the flux transfer function of a superconducting transformer for inter-qubits coupling. 相似文献
15.
We propose a scalable method for implementing linear optics quantum computation using the "linked-state" approach. Our method avoids the two-dimensional spread of errors occurring in the preparation of the linked state. Consequently, a proof is given for the scalability of this modified linked-state model, and an exact expression for the efficiency of the method is obtained. Moreover, a considerable improvement in the efficiency, relative to the original linked-state method, is achieved. The proposed method is applicable to Nielsen's optical "cluster-state" approach as well. 相似文献
16.
Gea-Banacloche J 《Physical review letters》2002,89(21):217901
A lower bound on the amount of energy needed to carry out an elementary logical operation on a quantum computer, with a given accuracy and in a given time, is derived. The bound arises from the requirement that the controls used to manipulate the qubits, which ultimately are themselves quan-tum mechanical systems, must nonetheless be classical to a sufficiently good approximation; it is expected to hold under a wide variety of conditions, and independently of the nature of the physical systems used to encode the qubits. This could have important consequences for very large-scale quantum computations. 相似文献
17.
18.
We establish a framework which allows one to construct novel schemes for measurement-based quantum computation. The technique develops tools from many-body physics-based on finitely correlated or projected entangled pair states-to go beyond the cluster-state based one-way computer. We identify resource states radically different from the cluster state, in that they exhibit nonvanishing correlations, can be prepared using nonmaximally entangling gates, or have very different local entanglement properties. In the computational models, randomness is compensated in a different manner. It is shown that there exist resource states which are locally arbitrarily close to a pure state. We comment on the possibility of tailoring computational models to specific physical systems. 相似文献
19.
We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess the universality of graph states by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal nongraph state. 相似文献
20.
Solid-state quantum computation station belongs to the group 2 of manipulation of quantum state in the Synergetic Extreme Condition User Facility. Here we will first outline the research background, aspects, and objectives of the station,followed by a discussion of the recent scientific as well as technological progress in this field based on similar experimental facilities to be constructed in the station. Finally, a brief summary and research perspective will be presented. 相似文献