Dynamic quantum circuits (DQCs) incorporate mid-circuit measurements and gates conditioned on these measurement outcomes. DQCs can prepare certain long-range entangled states in constant depth, making them a promising route to preparing complex quantum states on devices with a limited coherence time. Almost all constructions of DQCs for state preparation have been formulated analytically, relying on special structure in the target states. In this work, we approach the problem of state preparation variationally, developing scalable tensor network algorithms which find high-fidelity DQC preparations for generic states. We apply our algorithms to critical states, random matrix product states, and subset states. We consider both DQCs with a fixed number of ancillae and those with an extensive number of ancillae. Even in the few ancillae regime, the DQCs discovered by our algorithms consistently prepare states with lower infidelity than a static quantum circuit of the same depth. Notably, we observe constant fidelity gains across system sizes and circuit depths. For DQCs with an extensive number of ancillae, we introduce scalable methods for decoding measurement outcomes, including a neural network decoder and a real-time decoding protocol. Our work demonstrates the power of an algorithmic approach to generating DQC circuits, broadening their scope of applications to new areas of quantum computing.
Scalable Preparation of Matrix Product States with Sequential and Brick Wall Quantum Circuits
Zentrum für Optische Quantentechnologien, Universität Hamburg(汉堡大学光学量子技术中心);Department of Physics and Astronomy, University of Tennessee, Chattanooga(田纳西大学查塔努加分校物理与天文系);UTC Quantum Center, University of Tennessee, Chattanooga(田纳西大学查塔努加分校UTC量子中心);The Hamburg Centre for Ultrafast Imaging, Universität Hamburg(汉堡大学超快成像中心)
Scalable Multi-QPU Circuit Design for Dicke State Preparation: Optimizing Communication Complexity and Local Circuit Costs
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Shandong University(山东大学)
Practical Log-Depth Quantum State Preparation and Circuit Verification via Tree Tensor Network Compilation
University College London(伦敦大学学院);Centre for Computational Science, Department of Chemistry, University College London(伦敦大学学院化学系计算科学中心);Advanced Research Computing Centre, University College London(伦敦大学学院高级计算研究中心);Informatics Institute, University of Amsterdam(阿姆斯特丹大学信息学研究所)
Data and code for collision-model Dicke-state preparation: depth-fidelity frontiers, circuit costs, and superconducting-processor measurements
Saint Louis University(圣路易斯大学);KT One;University of South Florida(南佛罗里达大学);Koç University(科奇大学);TÜBİTAK Research Institute for Fundamental Sciences (TBAE)(土耳其科技研究基金会基础科学研究所(TBAE));Tokyo International University(东京国际大学);Nanoelectronics Research Center(纳米电子学研究中心)
Fault-tolerant ancilla preparation and noise threshold lower bounds for the 23-qubit Golay code
在容错量子计算方案中,开销通常由可靠地准备码字的成本决定。该成本通常与底层量子纠错码的块大小成二次方地增加。因此,大的代码,否则是非常有效的发现有限的容错应用。因此,容错准备电路是优化的重要目标。我们研究了Golay码,这是一种23量子比特的量子纠错码,可以保护逻辑量子比特的距离为7。在模拟中,即使使用一个天真的辅助准备过程中,Golay码是竞争力与其他代码的开销和可容忍的噪声阈值。我们提供了两个简化的电路容错准备戈莱码编码的辅助。新电路最大限度地减少了错误传播,与标准编码电路相比,开销大约减少了四分之一。通过将恶性集计数技术应用于去极化噪声,我们进一步证明了每个门的阈值高于1.32 x 10^{-3}噪声。
Efficient explicit circuit for quantum state preparation of piecewise continuous functions
Global College, Shanghai Jiao Tong University(上海交通大学全球学院);Institute of Natural Sciences, School of Mathematical Sciences, Shanghai Jiao Tong University(上海交通大学数学科学学院自然科学研究院);Ministry of Education Key Laboratory in Scientific and Engineering Computing, Shanghai Jiao Tong University(上海交通大学教育部科学与工程计算重点实验室);Shanghai Artificial Intelligence Laboratory(上海人工智能实验室)
Mitigating errors in state preparation and measurement with noncomputational states
IBM Quantum, IBM Research Europe – Zurich(IBM量子,IBM欧洲苏黎世研究部);Laboratory of Theoretical Physics of Nanosystems, École Polytechnique Fédérale de Lausanne(洛桑联邦理工学院纳米系统理论物理实验室);Theory and Simulation of Materials, École Polytechnique Fédérale de Lausanne(洛桑联邦理工学院材料理论与模拟)
Matrix-product entanglement characterizing the optimality of state-preparation quantum circuits
Capital Normal University(首都师范大学);Artificial intelligence College of Putian University(莆田学院人工智能学院);Institute of Theoretical Physics, Chinese Academy of Sciences(中国科学院理论物理研究所);Kavli Institute for Theoretical Sciences, University of Chinese Academy of Sciences(中国科学院大学 Kavli 理论科学研究所)