arXiv subjects

Ye-Min Zhan

Publications and source records attributed to Ye-Min Zhan.

3 recordsLinked to original sources

arXiv2025

Correlated helimagnetic configuration in a nonsymmorphic magnetic nodal semimetal

Nonsymmorphic magnetic Weyl semimetal materials such as ReAlX (Re=rare earth, X=Si/Ge) provide a unique opportunity to explore the correlated phenomena between Weyl fermions and nontrivial magnetic configurations. To be specific, we study a lattice model in which the magnetic configuration is determined by the competition among ferromagnetic (FM) interaction, the Dzyaloshinskii-Moriya interaction, and the Kondo coupling $K_0$ to the Weyl fermion. Both quantum and finite-temperature phase transitions between FM and correlated nesting helical configurations are found. Different from the uncorrelated helimagnet that decouples from the Weyl fermions, this correlated helimagnet induces a magnetic Brillouin zone with a $K_0$-dependent nesting in the band structure of the conduction electrons instead of the monopole-like Weyl cone. By measuring the current induced by the chiral magnetic effect on the conduction electron with nesting Weyl nodes, one can distinguish the correlated nesting helical order from the ferromagnetism because the chiral magnetic effect is considerably suppressed in the former case. These properties we find here may explain the experimental observations in ReAlX.

cond-mat.mes-hall↗

arXiv2024

Dissipationless topological quantum computation for Majorana objects in sparse-dense mixed encoding process

Topological quantum computation based on Majorana objects is subject to a significant challenge because at least some of the two-qubit quantum gates rely on the fermion (either charge or spin) parity of the qubits. This dependency renders the quantum operations involving these gates probabilistic when attempting to advance quantum processes within the quantum circuit model. Such an approach leads to significant information loss whenever measurements yield the undesired fermion parity. To resolve the problem of wasting information, we devise topological operations that allow for the non-dissipative correction of information from undesired fermion parity to the desired one. We will use the sparse-dense mixed encoding process for the controlled-NOT gate as an example to explain how corrections can be implemented without affecting the quantum information carried by the computational qubits. This correction process can be applied {to} either the undesired input qubits or the fermion parity-dependent quantum gates, and it works for both Majorana-zero-mode-based and Majorana-edge-mode-based topological quantum computation.

quant-ph↗

arXiv2022

Universal topological quantum computation with strongly correlated Majorana edge modes

Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models. In Ref. \cite{hukane}, it has been shown that a strongly correlated Majorana edge mode in a chiral topological superconductor can be decomposed into a Fibobacci anyon $τ$ and a thermal operator anyon $\varepsilon$ in the tricritical Ising model. The deconfinement of $τ$ and $\varepsilon$ via the interaction between the fermion modes yields the anyon {collisions} and gives the braiding of either $τ$ or $\varepsilon$. With these braidings, the complete members {of} a set of universal gates, the Pauli gates, the Hadamard gate and extra phase gates for 1-qubit as well as controlled-not gate for 2-qubits, are topologically assembled. Encoding quantum information and reading out the computation results can be carried out through electric signals. With the sparse-dense mixed encodings, we set up the quantum circuit {where the controlled-not gate turns out { to be} a probabilistic gate} and design the corresponding devices with thin films of the chiral topological superconductor. As an example of the universal topological quantum computing, we show the application to Shor's integer factorization algorithm.

cond-mat.str-el↗