Nicholas A. Allen

Nicholas A. Allen

Auto-generated profile, based on publicly available information

Nicholas A. Allen

Princeton University, Princeton, NJ, 08540, USA

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
1 December 2003 in SIMULATION
Verified
Journal Article
Closed access
PDF file
NANicholas A. Allen
Nicholas A. Allen
Clifford A. ShafferClifford A. Shaffer
Clifford A. Shaffer
NRNaren Ramakrishnan
Naren Ramakrishnan
MVMarc T. Vass
Marc T. Vass
LWLayne T. Watson
Layne T. Watson
Theoretical molecular biologists attempt to describe cellular processes and regulatory networks with continuous and discrete mathematical models. Previous practice has been to develop models largely by hand and then to validate them primarily by comparing time-series plots versus the observed experimental results. The authors report their experiences in designing and building a modeling support environment for cell cycle models. They describe improvements to the development process for molecular network models by (a) identifying the key elements of the existing modeling process, (b) incorporating simulation methodology into a revised modeling process, and (c) building and testing software that supports the revised modeling process.

4 October 2024 in Quantum
Verified
Journal Article
Open access
PDF file
TTTeague Tomesh
Teague Tomesh
NANicholas Allen
Nicholas Allen
DDDaniel Dilley
Daniel Dilley
ZSZain Hamid Saleem
Zain Hamid Saleem
The computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case – applying the Quantum Approximate Optimization Algorithm (QAOA) to instances of the Maximum Independent Set (MIS) problem. We consider three variants of the QAOA which offer different tradeoffs at the algorithmic level in terms of their required number of classical parameters, quantum gates, and iterations of classical optimization needed. Since MIS is a constrained combinatorial optimization problem, the QAOA must respect the problem constraints. This can be accomplished by using many multi-controlled gate operations which must be decomposed into gates executable by the target hardware. We study the tradeoffs available at this hardware level, combining the gate fidelities and decomposition efficiencies of different native gate sets into a single metric called the gate decomposition cost.