Scholar
Andreas Bärtschi
Google Scholar ID: 84KL6GkAAAAJ
Scientist, Los Alamos National Laboratory
Citations & Impact
Citations
1,966
H-index
19
i10-index
29
Publications
20
Co-authors
35
list available
Contact
No contact links provided.
Publications
Resume (English only)
Academic Achievements
- Developed a linear-depth quantum circuit for deterministic preparation of Dicke states (superpositions of n-qubit basis states with Hamming weight k)
- Extended to deterministic preparation of arbitrary symmetric pure states and quasi-linear-depth quantum compression into logarithmically many qubits
- Contributed approximation/exact algorithms and hardness results for energy-constrained package delivery with mobile agents
- Established the best-known upper bound for the conflict-free chromatic art gallery problem: any n-vertex polygon can be covered with ≤n guards using ≤3 log n + 3 colors
- Served as Organizing Committee Chair of the European Girls' Mathematical Olympiad (EGMO 2017) in Zürich, with ~400 participants, 44 teams, and a ~$600,000 budget
- Published at SoCG 2014; additional work available on arXiv and in PhD thesis
Research Experience
- Scientist at CCS-3, Los Alamos National Laboratory (LANL) since October 2018; Postdoc at CNLS and NSEC until 2021
- Postdoctoral Research Associate, Department of Computer Science (D-INFK), ETH Zürich (2018)
- Research and Teaching Assistant, D-INFK, ETH Zürich (2013–2017)
- Mathematics and ICT Teacher, Kathmandu International Study Center (KISC) (2012–2013, Swiss civilian service)
- Research Assistant, Swiss Federal Institute for Forest, Snow and Landscape Research (WSL) (2012, Swiss civilian service)
- Visiting Research Scholar, University of California, Santa Barbara (2011), Host: Subhash Suri
Education
- PhD in Computer Science (2017), ETH Zürich, Advisor: Peter Widmayer
- MSc in Mathematics (2011), ETH Zürich
- BSc in Mathematics (2009), ETH Zürich
- Didaktikzertifikat (2011) for college-level teaching
- Lehrdiplom (2019) for high school mathematics teaching
Background
- Research interests lie in quantum computing and combinatorial optimization
- Focuses on cross-fertilization between the two fields, e.g., quantum algorithms for approximate optimization
- Works on compiling quantum circuits and mapping Ising models to current noisy intermediate-scale quantum (NISQ) hardware
- Specific topics include Quantum Alternating Operator Ansatz (QAOA), initial state preparation, and design/compilation/analysis of mixing and phase-separation operators
- Also studies classical preprocessing and graph embedding for D-Wave quantum annealing
