Mark Fingerhuth

Mark Fingerhuth

Auto-generated profile, based on publicly available information

Mark Fingerhuth

School of Chemistry and Physics Quantum Research Group University of KwaZulu-Natal Durban KwaZulu-Natal 4001 South Africa

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2017 in Europhysics Letters
Verified
Journal Article
Open access
PDF file
MSM. Schuld
M. Schuld
MFM. Fingerhuth
M. Fingerhuth
FPF. Petruccione
F. Petruccione
Lately, much attention has been given to quantum algorithms that solve pattern recognition tasks in machine learning. Many of these quantum machine learning algorithms try to implement classical models on large-scale universal quantum computers that have access to nontrivial subroutines such as Hamiltonian simulation, amplitude amplification and phase estimation. We approach the problem from the opposite direction and analyse a distance-based classifier that is realised by a simple quantum interference circuit. After state preparation, the circuit only consists of a Hadamard gate as well as two single-qubit measurements, and computes the distance between data points in quantum parallel. We demonstrate the proof of principle using the IBM Quantum Experience and analyse the performance of the classifier with numerical simulations.

5 June 2020 in Science Advances
Verified
Journal Article
Open access
PDF file
LBLeonardo Banchi
Leonardo Banchi
MFMark Fingerhuth
Mark Fingerhuth
TBTomas Babej
Tomas Babej
CIChristopher Ing
Christopher Ing
JAJuan Miguel Arrazola
Juan Miguel Arrazola
Photonic quantum devices called Gaussian Boson Samplers can be programmed to predict molecular docking configurations.

20 December 2018 in PLOS ONE
Verified
Journal Article
Open access
PDF file
MFMark Fingerhuth
Mark Fingerhuth
TBTomáš Babej
Tomáš Babej
PWPeter Wittek
Peter Wittek
Open source software is becoming crucial in the design and testing of quantum algorithms. Many of the tools are backed by major commercial vendors with the goal to make it easier to develop quantum software: this mirrors how well-funded open machine learning frameworks enabled the development of complex models and their execution on equally complex hardware. We review a wide range of open source software for quantum computing, covering all stages of the quantum toolchain from quantum hardware interfaces through quantum compilers to implementations of quantum algorithms, as well as all quantum computing paradigms, including quantum annealing, and discrete and continuous-variable gate-model quantum computing. The evaluation of each project covers characteristics such as documentation, licence, the choice of programming language, compliance with norms of software engineering, and the culture of the project. We find that while the diversity of projects is mesmerizing, only a few attract external developers and even many commercially backed frameworks have shortcomings in software engineering. Based on these observations, we highlight the best practices that could foster a more active community around quantum computing software that welcomes newcomers to the field, but also ensures high-quality, well-documented code.

1 August 2019 in New Journal of Physics
Verified
Journal Article
Open access
DPDaniel K Park
Daniel K Park
ISIlya Sinayskiy
Ilya Sinayskiy
MFMark Fingerhuth
Mark Fingerhuth
FPFrancesco Petruccione
Francesco Petruccione
JRJune-Koo Kevin Kevin Rhee
June-Koo Kevin Kevin Rhee
The computational cost of preparing a quantum state can be substantial depending on the structure of data to be encoded. Many quantum algorithms require repeated sampling to find the answer, mandating reconstruction of the same input state for every execution of an algorithm. Thus, the advantage of quantum computation can diminish due to redundant state initialization. We present a framework based on quantum forking that bypasses this fundamental issue and expedites a family of tasks that require sampling from independent quantum processes. Quantum forking propagates an input state to multiple quantum trajectories in superposition, and a weighted power sum of individual results from each trajectories is obtained in one measurement via quantum interference. The significance of our work is demonstrated via applications to implementing non-unitary quantum channels, studying entanglement and benchmarking quantum control. A proof-of-principle experiment is implemented on the IBM and Rigetti quantum cloud platforms.

29 October 2025 in bioRxiv
Verified
Preprint
Open access
ELElliot Layne
Elliot Layne
AKAshlin K. Kanawaty
Ashlin K. Kanawaty
ABAron Broom
Aron Broom
AKAlexander Kitaygorodsky
Alexander Kitaygorodsky
ANAnita K. Nivedha
Anita K. Nivedha
MFMark Fingerhuth
Mark Fingerhuth
Inverse protein folding methods have become central to the computational design of de novo proteins, but existing models struggle when tasked with generating high-affinity peptide binders. By combining peptide-specific finetuning with a novel decoding order strategy, we enhance pocket conditioning and enable more accurate sequence design for peptide-binding interfaces. Our approach delivers gains in computational metrics, increasing sequence recovery and improving in silico binder design success rate by 16% ™ 30%. In vitro validation finds that our method greatly improves the success rate of designing novel peptide agonists of the OPRM1 receptor, generating at least twice as many top-ranking agonists as the prevailing standard method ProteinMPNN.

28 September 2026 in bioRxiv
Verified
Preprint
Open access
PDF file
AKAlexander Kitaygorodsky
Alexander Kitaygorodsky
DHDavid Earl Hostallero
David Earl Hostallero
ABAron Broom
Aron Broom
ELElliot Layne
Elliot Layne
SHSungwon Hwang
Sungwon Hwang
MFMark Fingerhuth
Mark Fingerhuth
Fixed-backbone sequence discovery, or inverse folding , is a critical recurring task in the development of new polypeptide therapeutics. Once promising backbones are established for a target pocket, computational inverse folding methods greatly help accelerate generation of candidate sequences. Such methods are mature for the traditional case of limiting to the fixed twenty-letter canonical vocabulary; however, they cannot access the broader space of non-canonical amino acids (NCAAs). This design constraint is exacerbated for peptide binders, a fast-growing modality that readily incorporates NCAAs, though in practice non-canonical design frequently depends on laborious medicinal-chemistry campaigns. An extension of inverse folding to NCAAs is thus critical to accelerating design of novel therapeutic peptides. AtomWeaver uses a joint all-site, atom-level generative scheme that does not restrict side-chain categorical assignment by either predetermined or co-resolving residue identity. Conditioned only on a fixed peptide backbone and its target protein, its multi-component flow guides side-chain atoms as unlabeled points in R 3 from a nested shell prior to a variable-count final atom cloud. Identity is then read by matching each predicted cloud against a reference library of canonical and non-canonical templates. Since identity is decided only at decode time, the addressable vocabulary is a property of the library rather than of the trained weights: a new NCAA costs one reference structure and no retraining, and the model can select residues it was never prompted for and never saw in training. On a deep mutational scan of two peptide–target systems, AtomWeaver’s canonical readout shows high observed mean agreement with experimental values among the compared inverse-folding methods. In the mixed canonical–noncanonical setting that canonical-only baselines cannot support at all, it likewise retains ranking signal across both systems. AtomWeaver also displayed self-consistent designs on de novo binder backbones, with the highest interface confidence among compared methods. Notably, it reached these metrics while achieving broad empirical coverage of our 300-residue vocabulary, including four non-canonical types never visible in training. AtomWeaver thus serves canonical and non-canonical peptide design alike, while transforming residue vocabulary to an expandable inference-time choice.