for my own benefit

About the author

\(\newcommand{\bbA}{\mathbb{A}}\) \(\newcommand{\bbB}{\mathbb{B}}\) \(\newcommand{\bbC}{\mathbb{C}}\) \(\newcommand{\bbD}{\mathbb{D}}\) \(\newcommand{\bbE}{\mathbb{E}}\) \(\newcommand{\bbF}{\mathbb{F}}\) \(\newcommand{\bbG}{\mathbb{G}}\) \(\newcommand{\bbH}{\mathbb{H}}\) \(\newcommand{\bbI}{\mathbb{I}}\) \(\newcommand{\bbJ}{\mathbb{J}}\) \(\newcommand{\bbK}{\mathbb{K}}\) \(\newcommand{\bbL}{\mathbb{L}}\) \(\newcommand{\bbM}{\mathbb{M}}\) \(\newcommand{\bbN}{\mathbb{N}}\) \(\newcommand{\bbO}{\mathbb{O}}\) \(\newcommand{\bbP}{\mathbb{P}}\) \(\newcommand{\bbQ}{\mathbb{Q}}\) \(\newcommand{\bbR}{\mathbb{R}}\) \(\newcommand{\bbS}{\mathbb{S}}\) \(\newcommand{\bbT}{\mathbb{T}}\) \(\newcommand{\bbU}{\mathbb{U}}\) \(\newcommand{\bbV}{\mathbb{V}}\) \(\newcommand{\bbW}{\mathbb{W}}\) \(\newcommand{\bbX}{\mathbb{X}}\) \(\newcommand{\bbY}{\mathbb{Y}}\) \(\newcommand{\bbZ}{\mathbb{Z}}\)

\(\newcommand{\calA}{\mathcal{A}}\) \(\newcommand{\calB}{\mathcal{B}}\) \(\newcommand{\calC}{\mathcal{C}}\) \(\newcommand{\calD}{\mathcal{D}}\) \(\newcommand{\calE}{\mathcal{E}}\) \(\newcommand{\calF}{\mathcal{F}}\) \(\newcommand{\calG}{\mathcal{G}}\) \(\newcommand{\calH}{\mathcal{H}}\) \(\newcommand{\calI}{\mathcal{I}}\) \(\newcommand{\calJ}{\mathcal{J}}\) \(\newcommand{\calK}{\mathcal{K}}\) \(\newcommand{\calL}{\mathcal{L}}\) \(\newcommand{\calM}{\mathcal{M}}\) \(\newcommand{\calN}{\mathcal{N}}\) \(\newcommand{\calO}{\mathcal{O}}\) \(\newcommand{\calP}{\mathcal{P}}\) \(\newcommand{\calQ}{\mathcal{Q}}\) \(\newcommand{\calR}{\mathcal{R}}\) \(\newcommand{\calS}{\mathcal{S}}\) \(\newcommand{\calT}{\mathcal{T}}\) \(\newcommand{\calU}{\mathcal{U}}\) \(\newcommand{\calV}{\mathcal{V}}\) \(\newcommand{\calW}{\mathcal{W}}\) \(\newcommand{\calX}{\mathcal{X}}\) \(\newcommand{\calY}{\mathcal{Y}}\) \(\newcommand{\calZ}{\mathcal{Z}}\)

\(\newcommand{\dag}{\dagger}\) \(\newcommand{\tr}{\operatorname{tr}}\) \(\newcommand{\Tr}{\operatorname{Tr}}\) \(\newcommand{\det}{\operatorname{det}}\) \(\newcommand{\perm}{\operatorname{perm}}\) \(\newcommand{\coloneqq}{\mathrel{\vcenter{:}}=}\) \(\newcommand{\eqqcolon}{\mathrel{=\!\vcenter{:}}}\) \(\newcommand{\abs}[1]{\left\lvert #1 \right\rvert}\) \(\newcommand{\norm}[1]{\left\lVert #1 \right\rVert}\) \(\DeclareMathOperator*{\argmax}{arg\!\max}\) \(\DeclareMathOperator*{\argmin}{arg\!\min}\) \(\newcommand{\binom}[2]\) \(\newcommand{\bm}[1]{\boldsymbol{#1}}\) \(\newcommand{\Im}[1]{\operatorname{Im}\pargs{#1}}\) \(\newcommand{\Re}[1]{\operatorname{Re}\pargs{#1}}\) \(\newcommand{\sgn}[1]{\operatorname{sgn}\pargs{#1}}\)

\(\newcommand{\ket}[1]{\left\lvert #1 \right\rangle}\) \(\newcommand{\bra}[1]{\left\langle #1 \right\rvert}\) \(\newcommand{\braket}[2]{\left\langle #1 \vert #2 \right\rangle}\) \(\newcommand{\ketbra}[2]{\left\lvert #1 \right\rangle\!\left\langle #2 \right\rvert}\)

\(\newcommand{\parentheses}[1]{\left(#1\right)}\) \(\newcommand{\brackets}[1]{\left[#1\right]}\) \(\newcommand{\curlybrackets}[1]{\left\{#1\right\}}\) \(\newcommand{\angles}[1]{\left\langle #1\right\rangle}\) \(\newcommand{\ceil}[1]{\left\lceil #1\right\rceil}\) \(\newcommand{\floor}[1]{\left\lfloor #1\right\rfloor}\) \(\newcommand{\set}{\curlybrackets}\) \(\newcommand{\expval}{\angles}\) \(\newcommand{\comm}[2]{\brackets{#1, #2}}\)

\(\newcommand{\pargs}[1]{\!\parentheses{#1}}\) \(\newcommand{\bargs}[1]{\!\brackets{#1}}\) \(\newcommand{\cbargs}[1]{\!\curlybrackets{#1}}\) \(\newcommand{\Dom}[1]{\text{Dom}\pargs{#1}}\)

\(\DeclareMathOperator*{\Expval}{\mathbb{E}}\) \(\newcommand{\EX}[2]{\Expval_{#1}\bargs{#2}}\) \(\newcommand{\Pr}{\operatorname{Pr}}\)

\(\newcommand{\Hom}[1]{\operatorname{Hom}\pargs{#1}}\) \(\newcommand{\End}[1]{\operatorname{End}\pargs{#1}}\) \(\newcommand{\Aut}[1]{\operatorname{Aut}\pargs{#1}}\)

\(\newcommand{\bigO}[1]{\calO\pargs{#1}}\) \(\newcommand{\littleo}[1]{o\pargs{#1}}\) \(\newcommand{\bigOmega}[1]{\Omega\pargs{#1}}\) \(\newcommand{\littleomega}[1]{\omega\pargs{#1}}\) \(\newcommand{\bigTheta}[1]{\Theta\pargs{#1}}\) \(\newcommand{\poly}[1]{\operatorname{poly}\pargs{#1}}\) \(\newcommand{\polylog}[1]{\operatorname{polylog}\pargs{#1}}\)

\(\newcommand{\dd}{\mathop{}\!\mathrm{d}}\) \(\newcommand{\Dd}[1]{\mathop{}\!\mathrm{d^#1}}\) \(\newcommand{\e}{\mathrm{e}}\) \(\newcommand{\i}{\mathrm{i}}\) \(\newcommand{\U}{\mathrm{U}}\) \(\newcommand{\O}{\mathrm{O}}\) \(\newcommand{\SU}{\mathrm{SU}}\) \(\newcommand{\SO}{\mathrm{SO}}\) \(\newcommand{\Sp}{\mathrm{Sp}}\) \(\newcommand{\GL}{\mathrm{GL}}\)

Back to home page

I am currently a PhD candidate in the Department of Physics at the University of Maryland. See my CV.


Click to show/hide section

University of Maryland (Aug 2020 - Present)

I am a PhD candidate in the Joint Quantum Institute (JQI) and the Joint Center for Quantum Information and Computer Science (QuICS) supported by the JQI Graduate Fellowship. My supervisor is Professor Alexey Gorshkov.

Massachusetts Institute of Technology (Sep 2015 - Dec 2018)

I recieved my Bachelor of Science in physics and minor in Computer Science with a GPA 4.9/5.0.


Click to show/hide section

This list is not meant to be comprehensive.

qubovert (View on GitHub) (View documentation)

I created qubovert, a Python package for dealing with binary optimization problems. It is particularly designed to aid in converting optimization problems to a form that can be solved with quantum annealers and quantum optimization algorithms. I also used it as a way to learn more about best software practices, such as continuous integration, code coverage, code quality, etc.

Contribution to SciPy (View my pull request)

I am the author of pull request number 10648 on Python’s SciPy package. My contribution is included in the 1.5.0 release and later releases. The pull request implements an additional feature for SciPy’s minimization method. In my research of variational quantum algorithms, I devised a bounded version of the standard unbounded Powell minimization method and found to often perform much better than the other gradient-free minimizers. I then implemented this variant in SciPy’s software stack and created the pull request.

qusetta (View on GitHub)

I created qusetta, a Python package for translating between different quantum circuit representations, while I was at QC Ware.

C++ quantum computer (View on GitHub)

To learn about quantum computing, quantum algorithms, and C++, I coded a quantum computer simulator and implemented many quantum algorithms, such as Shor’s factorization algorithm, Grover’s search algorithm, etc.

Hockey Stats (View site) (View source)

A HTML/CSS/Javascript website hosted with GitHub pages to easily track ice hockey stats and keep notes while watching somebody play. The site stores cookies so that statistics are remembered even if the browser is closed.

Numerical steppers (View on GitHub)

I provide a general overview of implicit versus explicit and single- versus multi-step steppers for numerically solving differential equations. I implemented dozens of methods in Julia which are included at the end of the paper (see the link). I explore several interesting systems, including geodesics around Schwarzschild and Kerr black holes, motion of a Kapitza pendulum, E cross B drift of a charged particle in perpendicular electric and magnetic fields, etc. See the report and code on the GitHub page.

Android application (View on Google Play)

Published Android application called “Distance to Green” on the Google Play store under the developer name “Eigenjoe” with monetized adds from AdMob. See the link for more information.

Github blog comments (View site) (View source)

A simple javascript file hosted on my site to easily add comments to a blog by hosting the comments on Github pages. This is what I use for comments on this site.


Click to show/hide section

See my Google Scholar profile

  • Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time. C. Cirstoiu, Z. Homes, J. T. Iosue, L. Cincio, P. J. Coles, A. Sornborger. npj Quantum Inf 6, 82, 2020. arXiv:1910.04292, 2019.
  • Probing Ground-State Phase Transitions through Quench Dynamics. P. Titum, J. T. Iosue, J. R. Garrison, A. V. Gorshkov, Z.-X. Gong. PRL 123, 115701, 2019. arXiv:1809.06377, 2018.
  • A Jacobi Diagonlization and Anderson Acceleration Algorithm For Variational Quantum Algorithm Parameter Optimization. R. M. Parrish, J. T. Iosue, A. Ozaeta, P. L. McMahon. arXiv:1904.03206, 2019.


Click to show/hide section


  • An initial condition robust outer-loop optimization strategy for a Quantum Approximate Optimization Algorithm. NISQ Workshop at TQC, 2019. View my poster.


Click to show/hide section


Volunteer tutoring (Oct 2020 - Present)

I tutor undergraduate physics students at the University of Maryland for one hour a week.

Teaching assistant (Aug 2016 - Dec 2016)

I was a teaching assistant for a semester of Physics II, Electricity and Magnetism at MIT responsible for tutoring and helping twenty students through problems and concepts and grading their assignments. I was referred to as “best TA ever” by several students in anonymous subject evaluations.


Quantum algorithms researcher at QC Ware, Corp (Jan 2019 - Aug 2020)

I researched applications for near-term quantum computers (see Publications), researching real-world applications of quantum computers for various customer projects, and developed software for the QC Ware software platform (see forge.qcware.com).

MIT Laboratory for Nuclear Science - Hen Lab (Sep 2017 - Dec 2018)

I studied proton vs neutron dynamics in asymmetric nuclei and short range deuteron clustering in nuclei. We worked in collaboration with Thomas Jefferson National Accelerator in Virginia, using data collected there for our analysis. I worked alongside a graduate student and perform data analysis using C++ and ROOT. This includes particle identification and various detector specific work such as acceptance and fiducial analysis for 3He and 4He(e,e’p) and (e,e’d) reactions. Our goal was to filter out inelastic reaction channels so as to compare quasielastic collisions with theoretical models.

Los Alamos National Lab Quantum Computing Summer Fellowship (Summer 2018)

We developed a novel algorithm called Variational Fast Forwarding (VFF) for simulating quantum systems on a quantum computer beyond its coherence time. See Publications for our publication.

Joint Quantum Institute, University of Maryland (Summer 2017)

Worked alongside a postdoc to model short and long range interacting fermionic spin chains and Kitaev wires, focusing on how magnetic field and interaction strength parameters affect the steady state of the system. We studied the relationship between dynamical and quantum phase transitions via quench dynamics in integrable and nearly-integrable systems. Our paper is on PRL and arXiv (see Publications).

MIT Plasma Science and Fusion Center (Jan 2016 - May 2016)

Worked with a professor to model particle acceleration and transport in turbulent media using C. We focused particularly on an electron’s E cross B drift about its guiding center in spatially and time varying fields.

MIT Department of Nuclear Science and Engineering (Sep 2015 - Dec 2015)

Worked with a graduate student to model thermal and mechanical responses of nuclear waste storage canisters to Traveling Wave Reactor (TerraPower) fission waste using finite element software ADINA. We tested a proposed pin and filler structure against the model we generated.


Skate guard and ice hockey referee (Feb 2016 - Dec 2018)

I was a skate and ice hockey referee for MIT Intramural for most of my time at MIT. I also played on multiple teams.

Department of Energy, Office of Nuclear Energy (Jan 2016)

I interned at Space and Defense Power Systems. I shadowed the Director of Space and Defense Power Systems, learning about the DOE’s task of ensuring containment of nuclear material during NASA launches with Radioisotope Power Systems on-board. I used HTML/CSS to design a website that presents information on the department to the public.

Meadows Farms Nursery and Landscape (Mar 2013 - Mar 2015)



Click to show/hide section

I’m married to this wonderful lady; see her page here!