检索结果-内蒙古大学图书馆

arXiv 2025年

作者： Dutta, Rishab Allen, Brandon Vu, Nam P. Xu, Chuzhi Liu, Kun Miao, Fei Wang, Bing Surana, Amit Wang, Chen Ding, Yongshan Batista, Victor S. Department of Chemistry Yale University New HavenCT06520 United States Department of Chemistry Lafayette College EastonPA18042 United States Department of Electrical and Computer Engineering Lafayette College EastonPA18042 United States Department of Computer Science Yale University New HavenCT06520 United States School of Computing University of Connecticut StorrsCT06269 United States RTX Technology Research Center East HartfordCT06118 United States Department of Physics University of Massachusetts-Amherst AmherstMA01003 United States Department of Applied Physics Yale University New HavenCT06520 United States Yale Quantum Institute Yale University New HavenCT06511 United States

Optimization challenges span a wide array of fields, from logistics and scheduling to finance, materials science, and drug discovery. Among these, Quadratic Unconstrained Binary Optimization (QUBO) problems are especially significant due to their computational complexity and their potential as a key application for quantum computing. In this work, we introduce an approach for solving QUBO problems using hybrid qubit-qumode bosonic quantum computers—devices that manipulate and measure the quantum states of light within microwave cavity resonators. We map problems with soft and hard constraints onto the Hamiltonian of a hybrid quantum system, consisting of a single qubit coupled to multiple qumodes. The optimal solution is encoded in the ground state of the system, which is revealed by photon-number measurements. Trial states are prepared through universal qubit-qumode circuits, employing echoed conditional displacement (ECD) gates in combination with qubit rotations. Our approach demonstrates the immense potential of hybrid quantum systems, showcasing their ability to efficiently tackle complex optimization problems in both academia and industry. Copyright © 2025, The Authors. All rights reserved.

关键词： Ground state

来源：评论

学校读者我要写书评

暂无评论

Efficient product formulas for commutators and applications to quantum simulation

arXiv

引用

arXiv 2021年

作者： Chen, Yu-An Childs, Andrew M. Hafezi, Mohammad Jiang, Zhang Kim, Hwanmun Xu, Yijia Google Quantum AI 340 Main Street VeniceCA90291 United States Department of Physics Joint Quantum Institute NIST University of Maryland College ParkMD20742 United States Condensed Matter Theory Center University of Maryland College ParkMD20472 United States Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States Department of Computer Science University of Maryland College ParkMD20742 United States Institute for Advanced Computer Studies University of Maryland College ParkMD20742 United States Department of Electrical and Computer Engineering Institute for Research in Electronics and Applied Physics University of Maryland College ParkMD20742 United States Institute for Physical Science and Technology University of Maryland College ParkMD20742 United States

We construct product formulas for exponentials of commutators and explore their applications. First, we directly construct a third-order product formula with six exponentials by solving polynomial equations obtained using the operator differential method. We then derive higher-order product formulas recursively from the third-order formula. We improve over previous recursive constructions, reducing the number of gates required to achieve the same accuracy. In addition, we demonstrate that the constituent linear terms in the commutator can be included at no extra cost. As an application, we show how to use the product formulas in a digital protocol for counterdiabatic driving, which increases the fidelity for quantum state preparation. We also discuss applications to quantum simulation of one-dimensional fermion chains with nearest- and next-nearest-neighbor hopping terms, and two-dimensional fractional quantum Hall phases. Copyright © 2021, The Authors. All rights reserved.

关键词： quantum chemistry

来源：评论

学校读者我要写书评

暂无评论

Finite-Size Analysis of Prepare-and-Measure and Decoy-State quantum Key Distribution via Entropy Accumulation

引用

PRX quantum 2025年第2期6卷 020342-020342页

作者： Lars Kamin Amir Arqand Ian George Norbert Lütkenhaus Ernest Y.-Z. Tan Institute for Quantum Computing and Department of Physics and Astronomy University of Waterloo Waterloo Ontario N2L 3G1 Canada Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana Illinois 61801 USA

An important goal in quantum key distribution (QKD) is the task of providing a finite-size security proof without the assumption of collective attacks. For prepare-and-measure QKD, one approach for obtaining such proofs is the generalized entropy-accumulation theorem (GEAT) but thus far it has only been applied to study a small selection of protocols. In this work, we present techniques for applying the GEAT in finite-size analysis of generic prepare-and-measure protocols, with a focus on decoy-state protocols. In particular, we present an improved approach for computing entropy bounds for decoy-state protocols, which has the dual benefits of providing tighter bounds than previous approaches (even asymptotically) and being compatible with methods for computing min-trade-off functions in the GEAT. Furthermore, we develop methods to incorporate some improvements to the finite-size terms in the GEAT and implement techniques to automatically optimize the min-trade-off function. Our approach also addresses some numerical-stability challenges specific to prepare-and-measure protocols, which have not been addressed in previous works.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Experimental verification of entangled states in the adversarial scenario

引用

Physical Review Applied 2025年第6期23卷 064005-064005页

作者： Wen-Hao Zhang Zihao Li Gong-Chu Li Xu-Song Hong Huangjun Zhu Geng Chen Chuan-Feng Li Guang-Can Guo CAS Key Laboratory of Quantum Information University of Science and Technology of China Hefei Anhui 230026 China CAS Center for Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei Anhui 230026 China School of Physics and Optoelectronics Engineering Anhui University Hefei Anhui 230601 China State Key Laboratory of Surface Physics Department of Physics and Center for Field Theory and Particle Physics Fudan University Shanghai 200433 China Institute for Nanoelectronic Devices and Quantum Computing Fudan University Shanghai 200433 China Shanghai Research Center for Quantum Sciences Shanghai 201315 China Hefei National Laboratory Hefei 230088 China

Efficient verification of entangled states is crucial to many applications in quantum information processing. However, the effectiveness of standard quantum state verification (QSV) is based on the condition of independent and identical distribution (IID), which impedes its applications in many practical scenarios. Here we demonstrate a defensive QSV protocol, which is effective in all kinds of non-IID scenarios, including the extremely challenging adversarial scenario. To this end, we build a high-speed preparation-and-measurement apparatus controlled by quantum random-number generators. Our experiments clearly show that standard QSV protocols often provide unreliable fidelity certificates in non-IID scenarios. In sharp contrast, the defensive QSV protocol based on a homogeneous strategy can provide reliable and nearly tight fidelity certificates at comparable high efficiency, even under malicious attacks. Moreover, our scheme is tolerant of the imperfections in a realistic experiment, which is very appealing to practical applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

quantum Advantage in Simulating Stochastic Processes

引用

Physical Review X 2021年第2期11卷 021019-021019页

作者： Kamil Korzekwa Matteo Lostaglio Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University 30-348 Kraków Poland International Centre for Theory of Quantum Technologies University of Gdańsk 80-308 Gdańsk Poland ICFO-Institut de Ciencies Fotoniques The Barcelona Institute of Science and Technology Castelldefels (Barcelona) 08860 Spain QuTech Delft University of Technology P.O. Box 5046 2600 GA Delft Netherlands

We investigate the problem of simulating classical stochastic processes through quantum dynamics and present three scenarios where memory or time quantum advantages arise. First, by introducing and analyzing a quantum version of the embeddability problem for stochastic matrices, we show that quantum memoryless dynamics can simulate classical processes that necessarily require memory. Second, by extending the notion of space-time cost of a stochastic process P to the quantum domain, we prove an advantage of the quantum cost of simulating P over the classical cost. Third, we demonstrate that the set of classical states accessible via Markovian master equations with quantum controls is larger than the set of those accessible with classical controls, leading, e.g., to a potential advantage in cooling protocols.

关键词： quantum control quantum information processing Resource theories

来源：评论

学校读者我要写书评

暂无评论

Performance limits due to thermal transport in graphene single-photon bolometers

arXiv

引用

arXiv 2023年

作者： Fried, Caleb Jordan Russell, B. Arnault, Ethan G. Huang, Bevin Lee, Gil-Ho Englund, Dirk Henriksen, Erik A. Fong, Kin Chung Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States Department of Earth and Planetary Sciences Harvard University CambridgeMA02138 United States Department of Physics Harvard University CambridgeMA02138 United States Raytheon BBN Quantum Engineering and Computing Group CambridgeMA02138 United States Department of Physics Washington University in St. Louis St. LouisMO United States Intelligence Community Postdoctoral Research Fellowship Program Massachusetts Institute of Technology CambridgeMA02139 United States Department of Physics Pohang University of Science and Technology Pohang790-784 Korea Republic of

In high-sensitivity bolometers and calorimeters, the photon absorption often occurs at a finite distance from the temperature sensor to accommodate antennas or avoid the degradation of superconducting circuitry exposed to radiation. As a result, thermal propagation from the input to the temperature readout can critically affect detector performance. In this report we model the performance of a graphene bolometer, accounting for electronic thermal diffusion and dissipation via electron-phonon coupling at low temperatures in three regimes: clean, supercollision, and resonant scattering. Our results affirm the feasibility of a superconducting readout without Cooper-pair breaking by mid- and near-infrared photons, and provide a recipe for designing graphene absorbers for calorimetric single-photon detectors. We investigate the tradeoff between the input-readout distance and detector efficiency, and predict an intrinsic timing jitter of ∼2.7 ps. Based on our result, we propose a spatial-mode-resolving photon detector to increase communication bandwidth. Copyright © 2023, The Authors. All rights reserved.

关键词： Graphene

来源：评论

学校读者我要写书评

暂无评论

Optimal Measurement Structures for Contextuality Applications

arXiv

引用

arXiv 2022年

作者： Liu, Yuan Ramanathan, Ravishankar Horodecki, Karol Rosicka, Monika Horodecki, Pawel Department of Computer Science The University of Hong Kong Pokfulam Road Hong Kong Institute of Informatics National Quantum Information Centre Faculty of Mathematics Physics and Informatics University of Gdańsk Wita Stwosza 57 Gdańsk80-308 Poland International Centre for Theory of Quantum Technologies University of Gdańsk Wita Stwosza 63 Gdańsk80-308 Poland Faculty of Applied Physics and Mathematics Gdańsk University of Technology Gabriela Narutowicza 11/12 Gdańsk80-233 Poland

The Kochen-Specker (KS) theorem is a corner-stone result in the foundations of quantum mechanics describing the fundamental difference between quantum theory and classical non-contextual theories. Recently specific substructures termed 01-gadgets were shown to exist within KS proofs that capture the essential contradiction of the theorem. Here, we show these gadgets and their generalizations provide an optimal toolbox for contextuality applications including (i) constructing classical channels exhibiting entanglement-assisted advantage in zero-error communication, (ii) identifying large separations between quantum theory and binary generalised probabilistic theories, and (iii) finding optimal tests for contextuality-based semi-device-independent randomness generation. Furthermore, we introduce and study a generalisation to definite prediction sets for more general logical propositions, that we term higher-order gadgets. We pinpoint the role these higher-order gadgets play in KS proofs by identifying these as induced subgraphs within KS graphs and showing how to construct proofs of state-independent contextuality using higher-order gadgets as building blocks. The constructions developed here may help in solving some of the remaining open problems regarding minimal proofs of the Kochen-Specker theorem. Copyright © 2022, The Authors. All rights reserved.

关键词： quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Approximate complex amplitude encoding algorithm and its application to data classification problems

引用

Physical Review A 2024年第5期109卷 052423-052423页

作者： Naoki Mitsuda Tatsuhiro Ichimura Kouhei Nakaji Yohichi Suzuki Tomoki Tanaka Rudy Raymond Hiroyuki Tezuka Tamiya Onodera Naoki Yamamoto Sumitomo Mitsui Trust Bank Ltd. 1-4-1 Marunouchi Chiyoda-ku Tokyo 100-8233 Japan Quantum Computing Center Keio University 3-14-1 Hiyoshi Kohoku-ku Yokohama Kanagawa 223-8522 Japan Department of Chemistry University of Toronto Toronto Ontario Canada M5G 1Z8 Research Center for Emerging Computing Technologies National Institute of Advanced Industrial Science and Technology (AIST) 1-1-1 Umezono Tsukuba Ibaraki 305-8568 Japan Mitsubishi UFJ Financial Group Inc. and MUFG Bank Ltd. 2-7-1 Marunouchi Chiyoda-ku Tokyo 100-8388 Japan IBM Quantum IBM Japan 19-21 Nihonbashi Hakozaki-cho Chuo-ku Tokyo 103-8510 Japan Department of Computer Science University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo 113-0033 Japan Advanced Research Laboratory Technology Infrastructure Center Technology Platform Sony Group Corporation 1-7-1 Konan Minato-ku Tokyo 108-0075 Japan Graduate School of Science and Technology Keio University 3-14-1 Hiyoshi Kohoku-ku Yokohama Kanagawa 223-8522 Japan Department of Applied Physics and Physico-Informatics Keio University Hiyoshi 3-14-1 Kohoku-ku Yokohama 223-8522 Japan

quantum computing has a potential to accelerate data processing efficiency, especially in machine learning, by exploiting special features such as the quantum interference. The major challenge in this application is that, in general, the task of loading a classical data vector into a quantum state requires an exponential number of quantum gates. The approximate amplitude encoding (AAE) method, which uses a variational means to approximately load a given real-valued data vector into the amplitude of a quantum state, was recently proposed as a general approach to this problem mainly for near-term devices. However, AAE cannot load a complex-valued data vector, which narrows its application range. In this work, we extend AAE so that it can handle a complex-valued data vector. The key idea is to employ the fidelity distance as a cost function for optimizing a parametrized quantum circuit, where the classical shadow technique is used to efficiently estimate the fidelity and its gradient. We apply this algorithm to realize the complex-valued-kernel binary classifier called the compact Hadamard classifier, and then we present a numerical experiment showing that it enables classification of the Iris dataset and credit card fraud detection.

关键词： Machine learning quantum algorithms quantum circuits quantum information processing quantum simulation

来源：评论

学校读者我要写书评

暂无评论

Prospects for quantum process tomography at high energies

arXiv

引用

arXiv 2024年

作者： Altomonte, Clelia Barr, Alan J. Eckstein, Michal Horodecki, Pawel Sakurai, Kazuki Department of Physics King’s College Strand LondonWC2R 2LS United Kingdom Department of Physics University of Oxford Keble Road OX1 3RH Merton College Merton Street OxfordOX1 4JD United Kingdom Institute of Theoretical Physics Faculty of Physics Astronomy and Applied Computer Science Jagiellonian University ul. Lojasiewicza 11 Kraków30–348 Poland International Centre for Theory of Quantum Technologies University of Gdańsk Wita Stwosza 63 Gdańsk80-308 Poland Faculty of Applied Physics and Mathematics National Quantum Information Centre Gdańsk University of Technology Gabriela Narutowicza 11/12 Gdańsk80-233 Poland Institute of Theoretical Physics Faculty of Physics University of Warsaw Pasteura 5 Warsaw02-093 Poland

In quantum information theory, the evolution of an open quantum system – a unitary evolution followed by a measurement – is described by a quantum channel or, more generally, a quantum instrument. In this work, we formulate spin and flavour measurements in collider experiments as quantum instruments. We demonstrate that the Choi matrix, which completely determines input-output transitions, can be both theoretically computed from a given model and experimentally reconstructed from a set of final state measurements (quantum state tomography) using varied input states. The experimental reconstruction of the Choi matrix, known as quantum process tomography, offers a powerful new approach for probing potential extensions of the Standard Model within the quantum field theory framework and at the same time constitutes a new foundational test of quantum mechanics itself. As an example, we outline the quantum process tomography approach applied to the e+e− → tt¯ process at a polarized lepton collider. Copyright © 2024, The Authors. All rights reserved.

关键词： quantum channel

来源：评论

学校读者我要写书评

暂无评论

Hierarchical quantum Optimization via Backbone-Driven Problem Decomposition: Integrating Tabu-Search with QAOA

arXiv

引用

arXiv 2025年

作者： Gou, Minhui Li, Zeyang Xu, Hong-Ze Lu, Changbin Wang, Jing-Bo Wang, Yukun Hu, Meng-Jun Liu, Dong E. Zhuang, Wei-Feng Beijing Academy of Quantum Information Sciences Beijing100193 China Beijing Key Laboratory of Fault-Tolerant Quantum Computing Beijing100193 China State Key Laboratory of Low Dimensional Quantum Physics Department of Physics Tsinghua University Beijing100084 China College of Artificial Intelligence China University of Petroleum Beijing11414 China State Key Laboratory of Processors Institute of Computing Technology CAS Beijing100190 China Frontier Science Center for Quantum Information Beijing100184 China School of Computer Science and Technology Anhui University of Technology Maanshan243002 China Hefei National Laboratory Hefei230088 China

As quantum computing advances, quantum approximate optimization algorithms (QAOA) have shown promise in addressing combinatorial optimization problems. However, the limitations of Noisy Intermediate Scale quantum (NISQ) devices hinder the scalability of QAOA for large-scale optimization tasks. To overcome these challenges, we propose Backbone-Driven QAOA, a hybrid framework that leverages adaptive Tabu search for classical preprocessing to decompose large-scale quadratic unconstrained binary (QUBO) problems into NISQ-compatible subproblems. In our approach, adaptive Tabu search dynamically identifies and fixes backbone variables to construct reduced-dimensional subspaces that preserve the critical optimization landscape. These quantum-tractable subproblems are then solved via QAOA, with the resulting solutions iteratively refining the backbone selection in a closed-loop quantum-classical cycle. Experimental results demonstrate that our approach not only competes with, and in some cases surpasses, traditional classical algorithms but also performs comparably with recently proposed hybrid classical-quantum algorithms. Our proposed framework effectively orchestrates the allocation of quantum and classical resources, thereby enabling the solution of large-scale combinatorial optimization problems on current NISQ hardware. © 2025, CC BY.

关键词： Qubits

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：