activity
20242026
collaborators

8 papers

quant-ph2026

Circuit Design Informed Adaptive Variational Quantum Algorithms

Muhammad Umer, Dimitris G. Angelakis

Resource-efficient computation is of central importance in the noisy intermediate-scale quantum (NISQ) era, where decoherence, gate errors, and restricted qubit connectivity severe…

quant-ph2026

Minimum Toffoli depth for the multi-controlled Toffoli gate via teleportation

Spyros Tserkis, Muhammad Umer, Eleftherios Mastorakis +1

The decomposition of complex quantum operations into experimentally feasible gate sets has been a central challenge since the early development of quantum computing. The multi-cont…

cond-mat.quant-gas2026

Quantifying Quantum Computational Advantage on a Processor of Ultracold Atoms

Yong-Guang Zheng, Ying-Chao Shen, Wei-Yong Zhang +15

Nonequilibrium dynamics of quantum many-body systems is challenging for classical computing, providing opportunities for demonstrating practical quantum computational advantage wit…

quant-ph2026

Depth optimization of CNOT ladder circuits

Spyros Tserkis, Muhammad Umer, Dimitris G. Angelakis

The increasing depth of quantum circuits presents a major limitation for the execution of quantum algorithms, as the limited coherence time of physical qubits leads to noise that m…

quant-ph2026

Resource-Efficient Hadamard Test Tailored Variational Framework for Nonlinear Dynamics on Quantum Computers

Eleftherios Mastorakis, Muhammad Umer, Milena Guevara-Bertsch +3

Resource-efficient, low-depth implementations of quantum circuits remain a promising strategy for achieving reliable and scalable computation on quantum hardware, as they reduce ga…

quant-ph2026

An Information-Minimal Geometry for Qubit-Efficient Optimization

Gordon Ma, Dimitris G. Angelakis

Qubit-efficient optimization studies how large combinatorial problems can be addressed with quantum circuits whose width is far smaller than the number of logical variables. In qua…