首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 203 毫秒
1.
密度矩阵在量子力学中主要是扩展了态矢量的概念.约化密度矩阵是通过对整个系统中的密度矩阵的某一子系求部分迹得到的.本文首先介绍了约化密度矩阵的定义,然后指出约化密度矩阵在纠缠态的定义、两体系统中量子纠缠的度量、系统与环境耦合造成的退相干的物理机制等量子信息前沿领域方面的应用.  相似文献   

2.
赵建辉 《物理学报》2012,61(22):86-91
约化密度保真度(reducedensityfidelity)可以用来描述量子多体系统的量子相变,其是两个约化密度矩阵距离的度量.本文应用MERA(multi—scaleentanglementreorganizationansatz)算法,模拟自旋为1的一维量子Blume-Capel模型,并通过对约化密度保真度的计算,确定出其基态相图.单点和两点约化密度矩阵所包含的至关重要的信息的量是不同的,其会体现在约化密度保真度上.另外,本文还从局域序参量和系统能隙的角度,来探讨量子多体系统的相变.  相似文献   

3.
陈富州  程晨  罗洪刚 《物理学报》1990,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

4.
陈富州  程晨  罗洪刚 《物理学报》1996,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

5.
陈富州  程晨  罗洪刚 《物理学报》1963,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

6.
陈富州  程晨  罗洪刚 《物理学报》2010,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

7.
陈富州  程晨  罗洪刚 《物理学报》2018,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

8.
陈富州  程晨  罗洪刚 《物理学报》2007,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

9.
陈富州  程晨  罗洪刚 《物理学报》2002,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

10.
陈富州  程晨  罗洪刚 《物理学报》1991,68(12):120202-120202
密度矩阵重正化群方法(DMRG)在求解一维强关联格点模型的基态时可以获得较高的精度,在应用于二维或准二维问题时,要达到类似的精度通常需要较大的计算量与存储空间.本文提出一种新的DMRG异构并行策略,可以同时发挥计算机中央处理器(CPU)和图形处理器(GPU)的计算性能.针对最耗时的哈密顿量对角化部分,实现了数据的分布式存储,并且给出了CPU和GPU之间的负载平衡策略.以费米Hubbard模型为例,测试了异构并行程序在不同DMRG保留状态数下的运行表现,并给出了相应的性能基准.应用于4腿梯子时,观测到了高温超导中常见的电荷密度条纹,此时保留状态数达到104,使用的GPU显存小于12 GB.  相似文献   

11.
We clarify different definitions of the density matrix by proposing the use of different names, the full density matrix for a single-closed quantum system, the compressed density matrix for the averaged single molecule state from an ensemble of molecules, and the reduced density matrix for a part of an entangled quantum system, respectively. We show that ensembles with the same compressed density matrix can be physically distinguished by observing fluctuations of various observables. This is in contrast to a general belief that ensembles with the same compressed density matrix are identical. Explicit expression for the fluctuation of an observable in a specified ensemble is given. We have discussed the nature of nuclear magnetic resonance quantum computing. We show that the conclusion that there is no quantum entanglement in the current nuclear magnetic resonance quantum computing experiment is based on the unjustified belief that ensembles having the same compressed density matrix are identical physically. Related issues in quantum communication are also discussed.  相似文献   

12.
It has been claimed in the literature that impossibility of faster-than-light quantum communication has an origin of indistinguishability of ensembles with the same density matrix. We show that the two concepts are not related. We argue that even with an ideal single-atom-precision measurement, it is generally impossible to produce two ensembles with exactly the same density matrix; or to produce ensembles with the same density matrix, classical communication is necessary. Hence the impossibility of faster-than-light communication does not imply the indistinguishability of ensembles with the same density matrix.  相似文献   

13.
It has been claimed in the literature that impossibility of faster-than-light quantum communication has an origin of indistinguishability of ensembles with the same density matrix. We show that the two concepts are not related.We argue that even with an ideal single-atom-precision measurement, it is generally impossible to produce two ensembles with exactly the same density matrix; or to produce ensembles with the same density matrix, classical communication is necessary. Hence the impossibility of faster-than-light communication does not imply the indistinguishability of ensembles with the same density matrix.  相似文献   

14.
In this paper, a quantum secure direct communication protocol using ensembles with the same density matrix is proposed. The two communication parties can realize the message transmission using this method through a quantum channel, each bit of information can be transmitted using an ensemble and read out through global measurement.The eavesdropping behavior can be detected through the channel diagnoses.  相似文献   

15.
In this paper, a quantum secure direct communication protocol using ensembles with the same density matrix is proposed. The two communication parties can realize the message transmission using this method through a quantum channel, each bit of information can be transmitted using an ensemble and read out through global measurement. The eavesdropping behavior can be detected through the channel diagnoses.  相似文献   

16.
It has recently been argued (Shimony, Erkenntnis 45:337, 1997) that time-symmetry does not hold for pre- and post-selected ensembles in quantum mechanics. That conclusion depends on what is meant by “time-symmetry” in relation to those types of ensembles. It is shown that on the conventional view of time-symmetry, pre- and post-selected ensembles are time-symmetric as was originally proposed.  相似文献   

17.
For the unitary ensembles of N×N Hermitian matrices associated with a weight function w there is a kernel, expressible in terms of the polynomials orthogonal with respect to the weight function, which plays an important role. For the orthogonal and symplectic ensembles of Hermitian matrices there are 2×2 matrix kernels, usually constructed using skew-orthogonal polynomials, which play an analogous role. These matrix kernels are determined by their upper left-hand entries. We derive formulas expressing these entries in terms of the scalar kernel for the corresponding unitary ensembles. We also show that whenever w/w is a rational function the entries are equal to the scalar kernel plus some extra terms whose number equals the order of w/w. General formulas are obtained for these extra terms. We do not use skew-orthogonal polynomials in the derivations  相似文献   

18.
It is well known that density matrices can be used in quantum mechanics to represent the information available to an observer about either a system with a random wave function (statistical mixture) or a system that is entangled with another system (reduced density matrix). We point out another role, previously unnoticed in the literature, that a density matrix can play: it can be the conditional density matrix, conditional on the configuration of the environment. A precise definition can be given in the context of Bohmian mechanics, whereas orthodox quantum mechanics is too vague to allow a sharp definition, except perhaps in special cases. In contrast to statistical and reduced density matrices, forming the conditional density matrix involves no averaging. In Bohmian mechanics with spin, the conditional density matrix replaces the notion of conditional wave function, as the object with the same dynamical significance as the wave function of a Bohmian system.PACS number:03.65.Ta (foundations of quantum mechanics)  相似文献   

19.
We give a streamlined proof of a quantitative version of a result from P. Deift and D. Gioev, Universality in Random Matrix Theory for Orthogonal and Symplectic Ensembles. IMRP Int. Math. Res. Pap. (in press) which is crucial for the proof of universality in the bulk P. Deift and D. Gioev, Universality in Random Matrix Theory for Orthogonal and Symplectic Ensembles. IMRP Int. Math. Res. Pap. (in press) and also at the edge P. Deift and D. Gioev, {Universality at the edge of the spectrum for unitary, orthogonal and symplectic ensembles of random matrices. Comm. Pure Appl. Math. (in press) for orthogonal and symplectic ensembles of random matrices. As a byproduct, this result gives asymptotic information on a certain ratio of the β=1,2,4 partition functions for log gases.  相似文献   

20.
Protective measurement, which was proposed as a method of observing the wavefunction of a single system, is extended to the observation of the density matrix of a single system. This provides a new meaning to the density matrix as having the same ontological status as the wave function describing a pure state. This also enables quantum entropy to be associated with a single system.  相似文献   

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

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