Curriculum Vitae



Doctoral Student, Computer Science

Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, USA

  • Thesis topic: Transforming quantum circuits for quantum architectures with limited connectivity. Identified qubit routing, i.e., implementing permutations of qubits as an interesting subproblem and I am currently exploring this research direction under supervision of Andrew Childs.
  • Co-supervised undergraduate students Sam King and Hrishee Shahstri during and after a NSF research experience for undergraduates (REU) program.
  • Informally co-supervised Cem Unsal during the “Circuit Transformations for Quantum Architecture” project.
  • Worked on quantum algorithms and quantum cryptography under supervision of Yi-Kai Liu.

Master of Science, Computer Science

Delft, The Netherlands

Specialization Software Technology, with a focus on (distributed) algorithms and networks. Master’s thesis on routing for quantum networks under supervision of Stephanie Wehner at QuTech. Awarded “cum laude” (<5% of students).


Master of Science, Embedded Systems

Delft, The Netherlands

I constructed a proof of concept fiber-optic cable tap for less than €30. I also worked on software acceleration using vectorization (SSE), parallelization (Pthreads, OpenMP), GPGPU programming (CUDA), and DSPs. Awarded “cum laude”.


Bachelor of Science, Computer Science

Delft, The Netherlands

Awarded “cum laude”.


Bachelor of Science, Electrical Engineering

Delft, The Netherlands

Awarded “cum laude”.



Research Summer Internship

Redmond (virtual), WA, USA

Researched algorithms for executing circuits on quantum hardware. Used native operations to better use the hardware capabilities. Implemented proof of concept in Julia language that shows a 5x speed-up over state-of-the-art. Work performed with Vadym Kliuchnikov, Alexander Vaschillo, and Dmitry Vasilevsky.


Summer Intern

Yorktown Heights, NY, USA

Researched algorithms for quantum chemistry and contributed to Qiskit development under the supervision of Ali Javadi-Abhari.



Amsterdam, The Netherlands

Developed and deployed 7 APIs in 3 months using Node.js, RethinkDB and ElasticSearch. Provided interactive website interface and documentation for the APIs using OpenAPI.



Delft, The Netherlands

Worked with Stephanie Wehner to publish my thesis work as paper. Programmed and performed simulations in Scala on a multi-core server. Simulations code:



Amsterdam, The Netherlands

Constructed a recommender system for arts tourism in the Netherlands using a semantic database.


Teaching Assistant

Delft, The Netherlands

  • Assisted and graded one year of masters students in the fourth year Advanced Algorithms course.
  • Assisted and graded two years of bachelors students in the second year Algorithms course.



Program Committee (PC)

Reviewed abstracts submitted to the YQIS conference for talks and posters.


Computer Science Graduate Student Council

Member (2018–2019) and president (2020–present). Organized and contributed to the annual CS department picnic. Organized student trips and events to foster a community withing the department. Act as liaison between the department and graduate students.


Organize Seminar Recordings and Youtube.

Organized videotaping and processing of QuICS seminars for upload to the QuICS Youtube, to promote accessibility of research.


Assist with Organizing QuICS-JQI-CMTC Seminars

This weekly seminar series encourages the transfer of knowledge across the field of physics, computer science and math. I also made sure healthier food was available.


Live Stream and Video Recording

14th Conference on the Theory of Quantum Compilation, Communication and Cryptography

Helped with finding the appropriate hardware and assisted with the live streaming of TQC and NISQ workshop.



IBM PhD Fellowship

A stipend of $35,000/yr. plus $25,000 towards education expenses in the first year.


Tied 2nd Place IBM Developer challenge

A $1000 prize for developing software with IBM’s Qiskit to compile quantum circuits for the IBM quantum computer architectures.


Lanczos Graduate Fellowship

Joint Center for Quantum Information and Computer Science, College Park, MD

Covers tuition, stipend and an additional $5000/yr. Three fellowships were awarded.


Dean’s Graduate Fellowship

University of Maryland, College Park

An award of $2500 yearly.


Jacob K. Goldhauber Travel Award

University of Maryland, College Park

Covers $500 for travel to a conference.



Quantum routing with fast reversals


Circuit Transformations for Quantum Architectures


Circuit Transformations for Quantum Architectures

Qiskit Camp

Patents and Patent Applications


Nearly optimal time-independent reversal of a spin chain

A. Bapat, E. Schoute, A.V. Gorshkov, A.M. Childs

U.S. Provisional Patent Application 63/148662


Edge-Disjoint Paths for Multi-Qubit Operations In Quantum Circuit

M.E. Beverland, V. Kliuchnikov, E. Schoute, A. Vaschillo, D. Vasilevsky


in preparation

Quantum Routing

Aniruddha Bapat, Alexey V. Gorshkov, Andrew M. Childs, and Eddie Schoute

Qubit routing work in preparation.

in preparation


Michael Beverland, Vadym Kliuchnikov, and Eddie Schoute

Work stemming from a research internship at Microsoft Research.


Quantum routing with fast reversals

Aniruddha Bapat, Andrew M. Childs, Alexey V. Gorshkov, Samuel King, Eddie Schoute, Hrishee Shastri

NSF research for undergraduates (REU) work that I co-supervised.

We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a path of length n, we show that there exists a constant ϵ≈0.034 such that the quantum routing time is at most (1−ϵ)n, whereas any swap-based protocol needs at least time n−1. This represents the first known quantum advantage over swap-based routing methods and also gives improved quantum routing times for realistic architectures such as grids. Furthermore, we show that our algorithm approaches a quantum routing time of 2n/3 in expectation for uniformly random permutations, whereas swap-based protocols require time n asymptotically. Additionally, we consider sparse permutations that route k≤n qubits and give algorithms with quantum routing time at most n/3+O(k2) on paths and at most 2r/3+O(k2) on general graphs with radius r.


Nearly optimal time-independent state reversal of a spin chain

Aniruddha Bapat, Eddie Schoute, Alexey V. Gorshkov, and Andrew M. Childs

We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of N spins. Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with time-independent, non-uniform couplings. Under appropriate normalization, we implement this state reversal three times faster than a naive approach using SWAP gates, in time comparable to a protocol of Raussendorf [Phys. Rev. A 72, 052301 (2005)] that requires dynamical control. We also prove lower bounds on state reversal by using results on the entanglement capacity of Hamiltonians and show that we are within a factor 1.502(1+1/N) of the shortest time possible. Our lower bound holds for all nearest-neighbor qubit protocols with arbitrary finite ancilla spaces and local operations and classical communication. Finally, we extend our protocol to an infinite family of nearest-neighbor, time-independent Hamiltonian protocols for state reversal. This includes chains with nearly uniform coupling that may be especially feasible for experimental implementation.


Circuit Transformations for Quantum Architectures

Andrew M. Childs, Eddie Schoute, and Cem M. Unsal

Quantum computer architectures impose restrictions on qubit interactions. We propose efficient circuit transformations that modify a given quantum circuit to fit an architecture, allowing for any initial and final mapping of circuit qubits to architecture qubits. To achieve this, we first consider the qubit movement subproblem and use the routing via matchings framework to prove tighter bounds on parallel routing. In practice, we only need to perform partial permutations, so we generalize routing via matchings to that setting. We give new routing procedures for common architecture graphs and for the generalized hierarchical product of graphs, which produces subgraphs of the Cartesian product. Secondly, for serial routing, we consider the token swapping framework and extend a 4-approximation algorithm for general graphs to support partial permutations. We apply these routing procedures to give several circuit transformations, using various heuristic qubit placement subroutines. We implement these transformations in software and compare their performance for large quantum circuits on grid and modular architectures, identifying strategies that work well in practice.


Shortcuts to quantum network routing

E. Schoute, L. Mančinska, T. Islam, I. Kerenidis, and S. Wehner

A quantum network promises to enable long distance quantum communication, and assemble small quantum devices into a large quantum computing cluster. Each network node can thereby be seen as a small few qubit quantum computer. Qubits can be sent over direct physical links connecting nearby quantum nodes, or by means of teleportation over pre-established entanglement amongst distant network nodes. Such pre-shared entanglement effectively forms a shortcut - a virtual quantum link - which can be used exactly once.

Here, we present an abstraction of a quantum network that allows ideas from computer science to be applied to the problem of routing qubits, and manage entanglement in the network. Specifically, we consider a scenario in which each quantum network node can create EPR pairs with its immediate neighbours over a physical connection, and perform entanglement swapping operations in order to create long distance virtual quantum links. We proceed to discuss the features unique to quantum networks, which call for the development of new routing techniques. As an example, we present two simple hierarchical routing schemes for a quantum network of N nodes for a ring and sphere topology. For these topologies we present efficient routing algorithms requiring O(log N) qubits to be stored at each network node, O(polylog N) time and space to perform routing decisions, and O(log N) timesteps to replenish the virtual quantum links in a model of entanglement generation.


Shortcuts to Quantum Network Routing

E. Schoute

Master’s thesis.


Systematic Testing of Hardware Compilers: Testing the DWARV C-to-VHDL Compiler

A. J. Rouvoet, E. Schoute, and A. B. Booij

Bachelor’s thesis.