activity
20232026
most citedMultiple Silicon Dangling-Bond Charge qubits for quantum computing: A Hilbert-Space Analysis of the Hamiltonian

1 citations · 1 across the 5 of their papers we have counts for

collaborators

7 papers

quant-ph2026

Certifying Nonlocal Spin Quantum Entanglement from Local Tunneling Spectra

Payman Kazemikhah, Ruolun Zhang, Xiangyu Luo +4

Quantum entanglement is intrinsically nonlocal, whereas tunneling spectroscopy measures one site at a time. We show that this apparent mismatch can be overcome: local tunneling spe…

quant-ph2026

Imaging the topological sign of a Dirac mass with spin-polarized tunneling

Payman Kazemikhah, Ruolun Zhang, Byunghoon Kim +5

A Dirac mass is characterized not only by its magnitude but also by its sign, which influences the Berry curvature, Hall response, and the propagation direction of chiral boundary…

cond-mat.mtrl-sci2026

Quantized Photocurrents in Gapless Topological Matter

Byunghoon Kim, Tenzin Norden, Mohammad Yahyavi +17

The quantum Hall effect establishes that topology can fix a material response to integer multiples of fundamental constants when an energy gap isolates the relevant symmetry-protec…

quant-ph2025

Quantum-Efficient Convolution through Sparse Matrix Encoding and Low-Depth Inner Product Circuits

Mohammad Rasoul Roshanshah, Payman Kazemikhah, Hossein Aghababa

Convolution operations are foundational to classical image processing and modern deep learning architectures, yet their extension into the quantum domain has remained algorithmical…

quant-ph2023

XpookyNet: Advancement in Quantum System Analysis through Convolutional Neural Networks for Detection of Entanglement

Ali Kookani, Yousef Mafi, Payman Kazemikhah +3

The application of machine learning models in quantum information theory has surged in recent years, driven by the recognition of entanglement and quantum states, which are the ess…

quant-ph2023

Linear-depth quantum oracles for clique problems from edge colorings and graph states, with linear non-Clifford cost and a provably bounded-error k-clique search

Ali Hadizadeh Moghadam, Payman Kazemikhah, Hossein Aghababa

Quantum algorithms for clique problems are usually analyzed in the query model, where the graph is accessed through an oracle of unit cost. When the oracle must itself be compiled…

quant-ph2023★ 1 cited

Multiple Silicon Dangling-Bond Charge qubits for quantum computing: A Hilbert-Space Analysis of the Hamiltonian

Zahra Shaterzadeh-Yazdi

Silicon-based dangling-bond charge qubit is one of the auspicious models for universal fault-tolerant solid-state quantum computing. In universal quantum computing, it is crucial t…