Scholarlink

<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 <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11128_2025_4938_Article_IEq1.gif" Format="GIF" Height="23" Rendition="HTML" Resolution="72" Type="Linedraw" Width="82" /> </InlineMediaObject> <EquationSource Format="TEX">\(\mathcal {O}\left( D^{2N - n}\right) \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi mathvariant="script">O</mi> <mfenced close=")" open="("> <msup> <mi>D</mi> <mrow> <mn>2</mn> <mi>N</mi> <mo>-</mo> <mi>n</mi> </mrow> </msup> </mfenced> </mrow> </math></EquationSource> </InlineEquation> 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>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Convolutional and computer vision methods for accelerating partial tracing operation in quantum mechanics for general qudit systems

  • 期刊论文

  • 发表日期：

    2025年10月6日

查看全文
  • Aaditya Rudra,
  • M. S. Ramkarthik

摘要

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) \) O D 2 N - n 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.