{"title":"一般量子位系统量子力学中加速部分跟踪运算的卷积和计算机视觉方法","authors":"Aaditya Rudra, M. S. Ramkarthik","doi":"10.1007/s11128-025-04938-9","DOIUrl":null,"url":null,"abstract":"<div><p>Partial trace is a mathematical operation used extensively in quantum mechanics to study the subsystems of a composite quantum system and in several other applications such as calculation of entanglement measures. Calculating partial trace proves to be a computational challenge with an increase in the number of qubits as the Hilbert space dimension scales up exponentially and more so as we go from two-level systems (qubits) to <i>D</i>-level systems. In this paper, we present a novel approach to the partial trace operation that provides a geometrical insight into the structures and features of the partial trace operation. We utilize these facts to propose a new method to calculate partial trace using signal processing concepts, namely convolution, filters and multigrids. Our proposed method of partial tracing significantly reduces the computational complexity by directly selecting the features of the reduced subsystem rather than eliminating the traced-out subsystems. We give a detailed description of our method and provide some explicit examples of the computation. Our method can be generalized further to a <i>D</i>-level system of <i>N</i>-particles with a considerable reduction in computation time. The arithmetic complexity of our algorithm is <span>\\(\\mathcal {O}\\left( D^{2N - n}\\right) \\)</span> with <i>n</i> subsystems partially traced out. We also observe various geometrical patterns and self-forming fractal structures, which we discuss here. We give numerical evidence to all the claims.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 10","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Convolutional and computer vision methods for accelerating partial tracing operation in quantum mechanics for general qudit systems\",\"authors\":\"Aaditya Rudra, M. S. Ramkarthik\",\"doi\":\"10.1007/s11128-025-04938-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Partial trace is a mathematical operation used extensively in quantum mechanics to study the subsystems of a composite quantum system and in several other applications such as calculation of entanglement measures. Calculating partial trace proves to be a computational challenge with an increase in the number of qubits as the Hilbert space dimension scales up exponentially and more so as we go from two-level systems (qubits) to <i>D</i>-level systems. In this paper, we present a novel approach to the partial trace operation that provides a geometrical insight into the structures and features of the partial trace operation. We utilize these facts to propose a new method to calculate partial trace using signal processing concepts, namely convolution, filters and multigrids. Our proposed method of partial tracing significantly reduces the computational complexity by directly selecting the features of the reduced subsystem rather than eliminating the traced-out subsystems. We give a detailed description of our method and provide some explicit examples of the computation. Our method can be generalized further to a <i>D</i>-level system of <i>N</i>-particles with a considerable reduction in computation time. The arithmetic complexity of our algorithm is <span>\\\\(\\\\mathcal {O}\\\\left( D^{2N - n}\\\\right) \\\\)</span> with <i>n</i> subsystems partially traced out. We also observe various geometrical patterns and self-forming fractal structures, which we discuss here. We give numerical evidence to all the claims.</p></div>\",\"PeriodicalId\":746,\"journal\":{\"name\":\"Quantum Information Processing\",\"volume\":\"24 10\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2025-10-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Information Processing\",\"FirstCategoryId\":\"101\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s11128-025-04938-9\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MATHEMATICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-025-04938-9","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
Convolutional and computer vision methods for accelerating partial tracing operation in quantum mechanics for general qudit systems
Partial trace is a mathematical operation used extensively in quantum mechanics to study the subsystems of a composite quantum system and in several other applications such as calculation of entanglement measures. Calculating partial trace proves to be a computational challenge with an increase in the number of qubits as the Hilbert space dimension scales up exponentially and more so as we go from two-level systems (qubits) to D-level systems. In this paper, we present a novel approach to the partial trace operation that provides a geometrical insight into the structures and features of the partial trace operation. We utilize these facts to propose a new method to calculate partial trace using signal processing concepts, namely convolution, filters and multigrids. Our proposed method of partial tracing significantly reduces the computational complexity by directly selecting the features of the reduced subsystem rather than eliminating the traced-out subsystems. We give a detailed description of our method and provide some explicit examples of the computation. Our method can be generalized further to a D-level system of N-particles with a considerable reduction in computation time. The arithmetic complexity of our algorithm is \(\mathcal {O}\left( D^{2N - n}\right) \) with n subsystems partially traced out. We also observe various geometrical patterns and self-forming fractal structures, which we discuss here. We give numerical evidence to all the claims.
期刊介绍:
Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.