Searcharxiv⌕ Search

arXiv subjects

Feng Pan

Publications and source records attributed to Feng Pan.

At least 37 records · Page 2Linked to original sources

Integrating Neural Networks and Tensor Networks for Computing Free Energy

Computing free energy is a fundamental problem in statistical physics. Recently, two distinct methods have been developed and have demonstrated remarkable success: the tensor-network-based contraction method and the neural-network-based variational method. Tensor networks are accu?rate, but their application is often limited to low-dimensional systems due to the high computational complexity in high-dimensional systems. The neural network method applies to systems with general topology. However, as a variational method, it is not as accurate as tensor networks. In this work, we propose an integrated approach, tensor-network-based variational autoregressive networks (TNVAN), that leverages the strengths of both tensor networks and neural networks: combining the variational autoregressive neural network's ability to compute an upper bound on free energy and perform unbiased sampling from the variational distribution with the tensor network's power to accurately compute the partition function for small sub-systems, resulting in a robust method for precisely estimating free energy. To evaluate the proposed approach, we conducted numerical experiments on spin glass systems with various topologies, including two-dimensional lattices, fully connected graphs, and random graphs. Our numerical results demonstrate the superior accuracy of our method compared to existing approaches. In particular, it effectively handles systems with long-range interactions and leverages GPU efficiency without requiring singular value decomposition, indicating great potential in tackling statistical mechanics problems and simulating high-dimensional complex systems through both tensor networks and neural networks.

cond-mat.stat-mech↗

SAT problem and Limit of Solomonoff's inductive reasoning theory

This paper explores the Boolean Satisfiability Problem (SAT) in the context of Kolmogorov complexity theory. We present three versions of the distinguishability problem-Boolean formulas, Turing machines, and quantum systems-each focused on distinguishing between two Bernoulli distributions induced by these computational models. A reduction is provided that establishes the equivalence between the Boolean formula version of the program output statistical prediction problem and the #SAT problem. Furthermore, we apply Solomonoff's inductive reasoning theory, revealing its limitations: the only "algorithm" capable of determining the output of any shortest program is the program itself, and any other algorithms are computationally indistinguishable from a universal computer, based on the coding theorem. The quantum version of this problem introduces a unique algorithm based on statistical distance and distinguishability, reflecting a fundamental limit in quantum mechanics. Finally, the potential equivalence of Kolmogorov complexity between circuit models and Turing machines may have significant implications for the NP vs P problem. We also investigate the nature of short programs corresponding to exponentially long bit sequences that can be compressed, revealing that these programs inherently contain loops that grow exponentially.

cs.CC↗

Generative Decoding for Quantum Error-correcting Codes

Efficient and accurate decoding of quantum error-correcting codes is essential for fault-tolerant quantum computation, however, it is challenging due to the degeneracy of errors, the complex code topology, and the large space for logical operators in high-rate codes. In this work, we propose a decoding algorithm utilizing generative modeling in machine learning. We employ autoregressive neural networks to learn the joint probability of logical operators and syndromes in an unsupervised manner, eliminating the need for labeled training data. The learned model can approximately perform maximum likelihood decoding by directly generating the most likely logical operators for $k$ logical qubits with $\mathcal O(2k)$ computational complexity. Thus, it is particularly efficient for decoding high-rate codes with many logical qubits. The proposed approach is general and applies to a wide spectrum of quantum error-correcting codes including surface codes and quantum low-density parity-check codes (qLDPC), under noise models ranging from code capacity noise to circuit level noise. We conducted extensive numerical experiments to demonstrate that our approach achieves significantly higher decoding accuracy compared to the minimum weight perfect matching and belief propagation with ordered statistics on the surface codes and high-rate quantum low-density parity-check codes. Our approach highlights generative artificial intelligence as a potential solution for the real-time decoding of realistic and high-rate quantum error correction codes.

quant-ph↗

Deep learning approaches for nuclear binding energy prediction: a comparative study of RNN, GRU and LSTM Models

This study investigates the application of deep learning models-recurrent neural networks, gated recurrent units, and long short-term memory networks-for predicting nuclear binding energies. Utilizing data from the Atomic Mass Evaluation (AME2020), we incorporate key nuclear structure features, including proton and neutron numbers, as well as additional terms from the liquid drop model and shell effects. Our comparative analysis demonstrates that the gated recurrent units model achieves the lowest root-mean-square error (σRMSE) of 0.326 MeV, surpassing traditional regression-based approaches. To assess model reliability, we validate predictions using the GarveyKelson relations, obtaining an error of 0.202 MeV, and further test extrapolation capabilities using the WS, WS3, and WS4 models. The extrapolation analysis confirms the robustness of our approach, particularly in predicting binding energies for nuclei near the driplines. These results highlight the effectiveness of deep learning in nuclear BE predictions, highlighting its potential to enhance the accuracy and reliability of theoretical nuclear models.

nucl-th↗

Discovery of a large magnetic nonlinear Hall effect in an altermagnet

Since Edwin Halls groundbreaking discovery of the Hall effect in 1879, magnetism, spin, and quantization have been expanding the scope of Hall effects, continuously driving transformative progress in science and technology. Among them, the latest nonlinear Hall effect (NLHE), where longitudinal electric field tunes quantum geometry to generate nonlinear Hall voltage, attracts wide attention as a sensitive probe of topological phases across a wide range of materials. Here, we report a new Hall effect member: the magnetic nonlinear Hall effect (MNLHE), characterized by a quadratic Hall conductivity dependence on magnetic field, rather than electric field as in NLHE. This finding relies on an altermagnet, Mn5Si3 thin film, whose alternating-sign Berry curvatures ensure higher-order MNLHE clearly distinguishable from the first-order anomalous Hall effect. The observed quadratic dependence originates from chiral next-nearest-neighbor hopping processes that acquire magnetic-exchange-driven Zeeman energies and Haldane-like chiral flux phases. Remarkably, this MNLHE is non-analytic, as reversing the magnetic field flips the alternating spin-splitting bands and reverses the hopping chirality, which is absent in traditional NLHE. Beyond offering a distinctive transport fingerprint for altermagnet Mn5Si3 thin film, this MNLHE is large and unsaturated up to 60 T, providing opportunities for pulsed high-field sensing technologies in both fundamental researches and engineering applications.

cond-mat.mtrl-sci↗

Exact Decoding of Repetition Code under Circuit Level Noise

Repetition code forms a fundamental basis for quantum error correction experiments. To date, it stands as the sole code that has achieved large distances and extremely low error rates. Its applications span the spectrum of evaluating hardware limitations, pinpointing hardware defects, and detecting rare events. However, current methods for decoding repetition codes under circuit level noise are suboptimal, leading to inaccurate error correction thresholds and introducing additional errors in event detection. In this work, we establish that repetition code under circuit level noise has an exact solution, and we propose an optimal maximum likelihood decoding algorithm called planar. The algorithm is based on the exact solution of the spin glass partition function on planar graphs and has polynomial computational complexity. Through extensive numerical experiments, we demonstrate that our algorithm uncovers the exact threshold for depolarizing noise and realistic superconductor SI1000 noise. Furthermore, we apply our method to analyze data from recent quantum memory experiments conducted by Google Quantum AI, revealing that part of the error floor was attributed to the decoding algorithm used by Google. Finally, we implemented the repetition code quantum memory on superconducting systems with a 72-qubit quantum chip lacking reset gates, demonstrating that even with an unknown error model, the proposed algorithm achieves a significantly lower logical error rate than the matching-based algorithm.

quant-ph↗

Electrical Manipulation of Spin Splitting Torque in Altermagnetic RuO2

Due to nonrelativistic altermagnetic spin splitting effect (ASSE), altermagnets can generate time-reversal-odd spin current and spin splitting torque (SST) with spin polarization parallel to the Néel vector. Hence the effective manipulation of SST would provide plenty of opportunities for designable spintronic devices, which remains elusive. Here, the electrical control of SST is achieved in altermagnetic RuO2, based on controllable Néel vector of RuO2 and Néel vector-dependent generation of SST. We demonstrate the current-induced switching of Néel vector via spin-orbit torque in RuO2 films, according to the reversible polarity of electrical transport measurements and X-ray magnetic linear dichroism (XMLD). The XMLD also unprecedentedly demonstrates that Néel vector really exists in altermagnets. The switching of Néel vector to the current direction and resultantly enhanced spin polarization parallel to the Néel vector brings about stronger ASSE-induced spin current. Our findings not only enrich the properties of altermagnets but also pave the way for high speed memories and nano-oscillators with excellent controllability and efficiency.

cond-mat.mtrl-sci↗

Probing the Néel order in altermagnetic RuO2 films by X-ray magnetic linear dichroism

The emerging altermagnetic RuO2 with both compensated magnetic moments and broken time-reversal symmetry possesses nontrivial magneto-electronic responses and nonrelativistic spin currents, which are closely related to magnetic easy axis. To probe the Néel order in RuO2, we conducted Ru M3-edge X-ray magnetic linear dichroism (XMLD) measurement. For epitaxial RuO2 films, characteristic XMLD signals can be observed in either RuO2(100) and RuO2(110) at normal incidence or RuO2(001) at oblique incidence, and the signals disappear when test temperature exceeds Néel temperature. For nonepitaxial RuO2 films, the flat lines in the XMLD patterns of RuO2(100) and RuO2(110) demonstrate that there is no in-plane uniaxial alignment of Néel order in these samples, due to the counterbalanced Néel order of the twin crystals evidenced by X-ray diffraction phi-scan measurements. Our experimental results unambiguously demonstrate the antiferromagnetism in RuO2 films and reveal the spatial relation of Néel order to be parallel with RuO2 [001] crystalline axis. These research findings would deepen our understanding of RuO2 and other attractive altermagnetic materials applied in the field of spintronics.

cond-mat.mtrl-sci↗

Superionic Ionic Conductor Discovery via Multiscale Topological Learning

Lithium superionic conductors (LSICs) are crucial for next-generation solid-state batteries, offering exceptional ionic conductivity and enhanced safety for renewable energy and electric vehicles. However, their discovery is extremely challenging due to the vast chemical space, limited labeled data, and the understanding of complex structure-function relationships required for optimizing ion transport. This study introduces a multiscale topological learning (MTL) framework, integrating algebraic topology and unsupervised learning to tackle these challenges efficiently. By modeling lithium-only and lithium-free substructures, the framework extracts multiscale topological features and introduces two topological screening metrics-cycle density and minimum connectivity distance-to ensure structural connectivity and ion diffusion compatibility. Promising candidates are clustered via unsupervised algorithms to identify those resembling known superionic conductors. For final refinement, candidates that pass chemical screening undergo ab initio molecular dynamics simulations for validation. This approach led to the discovery of 14 novel LSICs, four of which have been independently validated in recent experiments. This success accelerates the identification of LSICs and demonstrates broad adaptability, offering a scalable tool for addressing complex materials discovery challenges.

cond-mat.mtrl-sci↗

Free-Energy Machine for Combinatorial Optimization

Finding optimal solutions to combinatorial optimization problems is pivotal in both scientific and technological domains, within academic research and industrial applications. A considerable amount of effort has been invested in the development of accelerated methods that leverage sophisticated models and harness the power of advanced computational hardware. Despite the advancements, a critical challenge persists, the dual demand for both high efficiency and broad generality in solving problems. In this work, we propose a general method, Free-Energy Machine (FEM), based on the ideas of free-energy minimization in statistical physics, combined with automatic differentiation and gradient-based optimization in machine learning. The algorithm is flexible, solving various combinatorial optimization problems using a unified framework, and is efficient, naturally utilizing massive parallel computational devices such as graph processing units (GPUs) and field-programmable gate arrays (FPGAs). We benchmark our algorithm on various problems including the maximum cut problems, balanced minimum cut problems, and maximum $k$-satisfiability problems, scaled to millions of variables, across both synthetic, real-world, and competition problem instances. The findings indicate that our algorithm not only exhibits exceptional speed but also surpasses the performance of state-of-the-art algorithms tailored for individual problems. This highlights that the interdisciplinary fusion of statistical physics and machine learning opens the door to delivering cutting-edge methodologies that will have broad implications across various scientific and industrial landscapes.

cond-mat.stat-mech↗

Lead-free Hybrid Perovskite: An Efficient Room Temperature Spin Generator via Large Interfacial Rashba effect

Two-dimensional (2D) hybrid organic-inorganic perovskite (HOIP) demonstates great potential for developing flexible and wearable spintronic devices, by serving as spin sources via the bulk Rashba effect (BRE). However, the practical application of BRE in 2D HOIP faces huge challenges, particularly due to the toxicity of lead, which is crucial for achieving large spin-orbit coupling, and the restrictions in 2D HOIP candidates to meet specific symmetry-breaking requirements. To overcome these obstacles, we design a strategy to exploit the interfacial Rashba effect (IRE) of lead-free 2D HOIP (C6H5CH2CH2NH3)2CuCl4 (PEA-CuCl), manifesting as an efficient spin generator at room temperature. IRE of PEA-CuCl originates from the large orbital hybridization at the interface between PEA-CuCl and adjacent ferromagnetic layers. Spin-torque ferromagnetic resonance measurements further quantify a large Rashba effective field of 14.04 Oe per 10^11 A m-2, surpassing those of lead-based HOIP and traditional all-inorganic heterojunctions with noble metals. Our lead-free 2D HOIP PEA-CuCl, which harnesses large IRE for spin generation, is efficient, nontoxic, and economic, offering huge promise for future flexible and wearable spintronic devices.

cond-mat.mtrl-sci↗

Tunable Quantum Anomalous Hall Effect via Crystal Order in Spin-Splitting Antiferromagnets

Quantum anomalous Hall (QAH) effect provides dissipationless chiral channels for spin transport, expected as an outstanding candidate in future low-power quantum computation. The spin-splitting band structure is vital for obtaining QAH effect in topological systems, with ferromagnetism indispensable to manipulate the Chern number. Herein, we challenge this wisdom by proposing tunable QAH effect in spin-splitting antiferromagnets with zero magnetization. Since the spin splitting of these unique magnets originates from the alternate crystal environment, the Chern number can be modulated not only by the conventional magnetic order, but also by the crystal order, opening an additional dimension for tuning QAH effect. Our concept is illustrated based on two-dimensional (2D) MnBi2Te4 (MBT) with even septuple layers (SLs), a typical axion insulator with fully magnetic compensation. By interlayer rotation and translation operations, sublattices of MBT with opposite magnetizations are no longer connected by inversion or mirror symmetries, leading to the transition to the QAH insulator. The flexible stacking of 2D materials enables the reversible Chern number by crystal design. Our work fundamentally reveals the crystal-order-dependent QAH effect in spin-splitting antiferromagnets, which would advance QAH effect-based devices towards high controllability, integration density and operation speed.

cond-mat.mes-hall↗

Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern GPUs

Efficient simulation of quantum circuits has become indispensable with the rapid development of quantum hardware. The primary simulation methods are based on state vectors and tensor networks. As the number of qubits and quantum gates grows larger in current quantum devices, traditional state-vector based quantum circuit simulation methods prove inadequate due to the overwhelming size of the Hilbert space and extensive entanglement. Consequently, brutal force tensor network simulation algorithms become the only viable solution in such scenarios. The two main challenges faced in tensor network simulation algorithms are optimal contraction path finding and efficient execution on modern computing devices, with the latter determines the actual efficiency. In this study, we investigate the optimization of such tensor network simulations on modern GPUs and propose general optimization strategies from two aspects: computational efficiency and accuracy. Firstly, we propose to transform critical Einstein summation operations into GEMM operations, leveraging the specific features of tensor network simulations to amplify the efficiency of GPUs. Secondly, by analyzing the data characteristics of quantum circuits, we employ extended precision to ensure the accuracy of simulation results and mixed precision to fully exploit the potential of GPUs, resulting in faster and more precise simulations. Our numerical experiments demonstrate that our approach can achieve a 3.96x reduction in verification time for random quantum circuit samples in the 18-cycle case of Sycamore, with sustained performance exceeding 21 TFLOPS on one A100. This method can be easily extended to the 20-cycle case, maintaining the same performance, accelerating by 12.5x compared to the state-of-the-art CPU-based results and 4.48-6.78x compared to the state-of-the-art GPU-based results reported in the literature.

quant-ph↗

Coupling and Recoupling Coefficients for Wigner's U(4) Supermultiplet Symmetry

A novel procedure for evaluating Wigner coupling coefficients and Racah recoupling coefficients for U(4) in two group-subgroup chains is presented. The canonical U(4)->U(3)->U(2)->U(1) coupling and recoupling coefficients are applicable to any system that possesses U(4) symmetry, while the physical U(4)->SU_S(2)xSU_T(2) coupling coefficients are more specific to nuclear structure studies that utilize Wigner's Supermultiplet Symmetry concept. The procedure that is proposed sidesteps the use of binomial coefficients and alternating sum series, and consequently enables fast and accurate computation of any and all U(4)-underpinned features. The inner multiplicity of a (S,T) pair within a single U(4) irreducible representation is obtained from the dimension of the null space of the SU(2) raising generators; while the resolution for the outer multiplicity follows from the work of Alex et al. on U(N). It is anticipated that a C++ library will ultimately be available for determining generic coupling and recoupling coefficients associated with both the \textit{canonical} and the \textit{physical} group-subgroup chains of U(4).

math-ph↗

Achieving Energetic Superiority Through System-Level Quantum Circuit Simulation

Quantum Computational Superiority boasts rapid computation and high energy efficiency. Despite recent advances in classical algorithms aimed at refuting the milestone claim of Google's sycamore, challenges remain in generating uncorrelated samples of random quantum circuits. In this paper, we present a groundbreaking large-scale system technology that leverages optimization on global, node, and device levels to achieve unprecedented scalability for tensor networks. This enables the handling of large-scale tensor networks with memory capacities reaching tens of terabytes, surpassing memory space constraints on a single node. Our techniques enable accommodating large-scale tensor networks with up to tens of terabytes of memory, reaching up to 2304 GPUs with a peak computing power of 561 PFLOPS half-precision. Notably, we have achieved a time-to-solution of 14.22 seconds with energy consumption of 2.39 kWh which achieved fidelity of 0.002 and our most remarkable result is a time-to-solution of 17.18 seconds, with energy consumption of only 0.29 kWh which achieved a XEB of 0.002 after post-processing, outperforming Google's quantum processor Sycamore in both speed and energy efficiency, which recorded 600 seconds and 4.3 kWh, respectively.

quant-ph↗

Leapfrogging Sycamore: Harnessing 1432 GPUs for 7$\times$ Faster Quantum Random Circuit Sampling

Random quantum circuit sampling serves as a benchmark to demonstrate quantum computational advantage. Recent progress in classical algorithms, especially those based on tensor network methods, has significantly reduced the classical simulation time and challenged the claim of the first-generation quantum advantage experiments. However, in terms of generating uncorrelated samples, time-to-solution, and energy consumption, previous classical simulation experiments still underperform the \textit{Sycamore} processor. Here we report an energy-efficient classical simulation algorithm, using 1432 GPUs to simulate quantum random circuit sampling which generates uncorrelated samples with higher linear cross entropy score and is 7 times faster than \textit{Sycamore} 53 qubits experiment. We propose a post-processing algorithm to reduce the overall complexity, and integrated state-of-the-art high-performance general-purpose GPU to achieve two orders of lower energy consumption compared to previous works. Our work provides the first unambiguous experimental evidence to refute \textit{Sycamore}'s claim of quantum advantage, and redefines the boundary of quantum computational advantage using random circuit sampling.

quant-ph↗

New Procedure for Evaluation of U(3) Coupling and Recoupling Coefficients

A simple method to calculate Wigner coupling coefficients and Racah recoupling coefficients for U(3) in two group-subgroup chains is presented. While the canonical U(3)->U(2)->U(1) coupling and recoupling coefficients are applicable to any system that respects U(3) symmetry, the U(3)->SO(3) coupling coefficients are more specific to nuclear structure studies. This new procedure precludes the use of binomial coefficients and alternating sums which were used in the 1973 formulation of Draayer and Akiyama, and hence provides faster and more accurate output of requested results. The resolution of the outer multiplicity is based on the null space concept of the U(3) generators proposed by Arne Alex et al., whereas the inner multiplicity in the angular momentum subgroup chain is obtained from the dimension of the null space of the SO(3) raising operator. A C++ library built on this new methodology will be published in a complementary journal that specializes in the management and distribution of such programs.

math-ph↗

Electrical-controllable antiferromagnet-based tunnel junction

Electrical-controllable antiferromagnet tunnel junction is a key goal in spintronics, holding immense promise for ultra-dense and ultra-stable antiferromagnetic memory with high processing speed for modern information technology. Here, we have advanced towards this goal by achieving an electrical-controllable antiferromagnet-based tunnel junction of Pt/Co/Pt/Co/IrMn/MgO/Pt. The exchange coupling between antiferromagnetic IrMn and Co/Pt perpendicular magnetic multilayers results in the formation of interfacial exchange bias and exchange spring in IrMn. Encoding information states 0 and 1 is realized through the exchange spring in IrMn, which can be electrically written by spin-orbit torque switching with high cyclability and electrically read by antiferromagnetic tunneling anisotropic magnetoresistance. Combining spin-orbit torque switching of both exchange spring andexchange bias, 16 Boolean logic operation is successfully demonstrated. With both memory and logic functionalities integrated into our electrical-controllable antiferromagnetic-based tunnel junction, we chart the course toward high-performance antiferromagnetic logic-in-memory.

physics.app-ph↗