As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But...can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.
Experimental demonstration of entanglement pumping with bosonic logical qubits
Tsinghua University（清华大学）；University of Science and Technology of China（中国科学技术大学）；Beijing Academy of Quantum Information Sciences（北京量子信息科学研究院）；Hefei National Laboratory（合肥国家实验室）
Logical entanglement distribution between distant 2D array qubits
Graduate School of Engineering Science, Osaka University（大阪大学工学研究科）；NTT Computer and Data Science Laboratories, NTT Corporation（日本电信电话公司计算机与数据科学实验室）；JST, PRESTO（日本科学技术振兴机构PRESTO项目）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Center for Quantum Information and Quantum Biology, Osaka University（大阪大学量子信息与量子生物学中心）；Faculty of Information Science and Technology, Hokkaido University（北海道大学信息科学与工程学院）
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Universität Innsbruck（因斯布鲁克大学）；Technische Universität Wien（维也纳工业大学）；Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）；neQxt GmbH（neQxt有限公司）；Alpine Quantum Technologies GmbH（阿尔卑斯量子技术有限公司）
Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures
Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich（于利希研究中心理论纳米电子学研究所）；Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）；Department of Physics, ETH Zurich（苏黎世联邦理工学院物理系）；ETH Zurich - PSI Quantum Computing Hub, Paul Scherrer Institute（保罗谢勒研究所苏黎世联邦理工学院-PSI量子计算中心）；Quantum Center, ETH Zurich（苏黎世联邦理工学院量子中心）
Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement
Infleqtion；Pritzker School of Molecular Engineering, University of Chicago（芝加哥大学普里茨克分子工程学院）；Department of Computer Science, University of Chicago（芝加哥大学计算机科学系）
Possible realization of entanglement, logical gates and quantum information transfer with superconducting-quantum-interference-device qubits in cavity QED
Quantum logic operations and creation of entanglement in a scalable superconducting quantum computer with long-range constant interaction between qubits
Logical multi-qubit entanglement with dual-rail superconducting qubits
International Quantum Academy, Shenzhen（国际量子研究院）；Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology（南方科技大学深圳量子科学与工程研究所）；Guangdong Provincial Key Laboratory of Quantum Science and Engineering, Southern University of Science and Technology（南方科技大学广东省量子科学与工程重点实验室）
On quantum logic operations based on photon-exchange interactions in an ensemble of non-interacting atoms
最近提出的通过原子系综中的交换相互作用在光子态之间产生纠缠的想法（J.D. Franson和T. B. Pitman，Phys.Rev.A60，917（1999）和J.D. Franson等人，（quant-ph/9912121））使用S-matix方法进行讨论。结果表明，如果原子的非线性响应可以忽略，并且没有额外的原子-原子相互作用，交换作用在使原子返回到初始态的过程中不会产生光子态之间的纠缠.纠缠的产生需要存在非线性原子响应或原子-原子相互作用。
Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
Nanofiber Quantum Technologies, Inc. (NanoQT)（纳米纤维量子技术有限公司）；Clarendon Laboratory, University of Oxford（牛津大学克拉伦登实验室）；Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo（东京大学大学院信息理工学研究系计算机科学专业）
我们表明，容错量子计算的阈值是唯一的单系统操作的质量，如果允许d维系统与$8 \leq d \leq 32$。每个系统用来存储一个逻辑量子比特，额外的辅助维度用来创建和净化系统之间的纠缠。具有高达2/3的错误率的物理的、可能概率性的双系统操作仍然是可以容忍的，以在逻辑量子比特上实现确定性的高质量双量子比特门。可达到的错误率是相同的数量级的单系统操作。我们调查我们的计划的几个物理设置可能的实现。
Towards logical entanglement creation in trivalent planar architectures
Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich（于利希研究中心理论纳米电子学研究所）；Institute for Quantum Information, RWTH Aachen University（亚琛工业大学量子信息研究所）；Department of Applied Physics, Yale University（耶鲁大学应用物理系）；Yale Quantum Institute, Yale University（耶鲁大学耶鲁量子研究所）；Atlantic Quantum（大西洋量子）
Remote Gottesman-Kitaev-Preskill Entanglement Generation between Trapped Ions
School of Mathematical and Physical Sciences, Keio University（庆应义塾大学数理科学学院）；Department of Electronics and Electrical Engineering, Keio University（庆应义塾大学电子电气工程系）；Advanced ICT Research Institute, National Institute of Information and Communications Technology (NICT)（信息通信研究机构高级ICT研究所）
