activity
19932026
most citedConductance quantization and transport gap in disordered graphene nanoribbons

340 citations · 3.7k across the 104 of their papers we have counts for

collaborators

104 papers

quant-ph2026

Separation of Statistical Complexity and Trainability in Variational Quantum Circuits

Suman Mandal, Maximillian Daughtry, Eduardo R. Mucciolo

Variational quantum algorithms (VQAs) are among the leading approaches for near-term quantum computing, yet their performance can degrade in barren plateau regimes characterized by…

cond-mat.str-el2026

Quantum Algorithms to Determine Spin-Resolved Exchange-Correlation Potential for Strongly Correlated Materials

H. Arslan Hashim, Volodymyr M. Turkowski, Eduardo R. Mucciolo

Accurate exchange-correlation (XC) potentials are essential for density functional theory, yet reliable approximations remain challenging for strongly correlated systems. In this w…

cond-mat.supr-con2025

Green's Function Methods for Computing Supercurrents in Josephson Junctions

Eduardo R. Mucciolo, Jouko Nieminen, Xiao Xiao +3

Interest in Josephson junctions (JJs) has increased rapidly in recent years not only because of their use in qubits and other quantum devices but also due to the unique physics sup…

cs.DS2025

A Matrix Product State Representation of Boolean Functions

Umut Eren Usturali, Claudio Chamon, Andrei E. Ruckenstein +1

We introduce a novel normal form representation of Boolean functions in terms of products of binary matrices, hereafter referred to as the Binary Matrix Product (BMP) representatio…

quant-ph2023

Quantum Algorithms for State Preparation and Data Classification based on Stabilizer Codes

Pejman Jouzdani, H. Arslan Hashim, Eduardo R. Mucciolo

Quantum error correction (QEC) is a way to protect quantum information against noise. It consists of encoding input information into entangled quantum states known as the code spac…

cond-mat.stat-mech2023★ 1 cited

Circuit complexity and functionality: a thermodynamic perspective

Claudio Chamon, Andrei E. Ruckenstein, Eduardo R. Mucciolo +1

Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circu…