Andreas Bärtschi

Andreas Bärtschi

Auto-generated profile, based on publicly available information

Andreas Bärtschi

Los Alamos National Laboratory

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
28 October 2024 in Nature Reviews Physics
Verified
Journal Article
Closed access
PDF file
AAAmira Abbas
Amira Abbas
AAAndris Ambainis
Andris Ambainis
BABrandon Augustino
Brandon Augustino
ABAndreas Bärtschi
Andreas Bärtschi
HBHarry Buhrman
Harry Buhrman
CZChrista Zoufal
Christa Zoufal

23 June 2022 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
EPElijah Pelofske
Elijah Pelofske
ABAndreas Bärtschi
Andreas Bärtschi
SEStephan Eidenbenz
Stephan Eidenbenz
Quantum volume (QV) has become the de-facto standard benchmark to quantify the capability of noisy intermediate-scale quantum (NISQ) devices. While QV values are often reported by NISQ providers for their systems, we perform our own series of QV calculations on 24 NISQ devices currently offered by IBM Q, IonQ, Rigetti, Oxford Quantum Circuits, and Quantinuum (formerly Honeywell). Our approach characterizes the performances that an advanced user of these NISQ devices can expect to achieve with a reasonable amount of optimization but without white-box access to the device. In particular, we compile QV circuits to standard gate sets of the vendor using compiler optimization routines where available, and we perform experiments across different qubit subsets. We find that running QV tests requires very significant compilation cycles, QV values achieved in our tests typically lag behind officially reported results and also depend significantly on the classical compilation effort invested.

6 December 2023
Verified
Report
Open access
PDF file
AAAmira Abbas
Amira Abbas
AAAndris Ambainis
Andris Ambainis
BABrandon Augustino
Brandon Augustino
ABAndreas Baertschi
Andreas Baertschi
HBHarry Buhrman
Harry Buhrman
CZChrista Zoufal
Christa Zoufal
The U.S. Department of Energy's Office of Scientific and Technical Information

12 May 2022 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
SAShamminuj Aktar
Shamminuj Aktar
ABAndreas Bartschi
Andreas Bartschi
ABAbdel-Hameed Badawy
Abdel-Hameed Badawy
SEStephan Eidenbenz
Stephan Eidenbenz
We present a divide-and-conquer approach to deterministically prepare Dicke states $|D^{n}_{k}\rangle$ (i.e., equal-weight superpositions of all $n$ -qubit states with Hamming weight $k$ ) on quantum computers. In an experimental evaluation for up to $n=6$ qubits on IBM Quantum Sydney and Montreal devices, we achieve significantly higher state fidelity compared to previous results. The fidelity gains are achieved through several techniques: our circuits first “divide” the Hamming weight between blocks of $n/2$ qubits, and then “conquer” those blocks with improved versions of Dicke state unitaries (Bärtschi et al. FCT’2019). Due to the sparse connectivity on IBM’s heavy-hex-architectures, these circuits are implemented for linear nearest neighbor topologies. Further gains in (estimating) the state fidelity are due to our use of measurement error mitigation and hardware progress.

12 March 2024 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
EPElijah Pelofske
Elijah Pelofske
ABAndreas Bärtschi
Andreas Bärtschi
SEStephan Eidenbenz
Stephan Eidenbenz
We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p = 1, 2 rounds is executed on the 127 qubit heavy-hex graph gate-model quantum computer ibm_washington, using on-device grid-searches for angle finding, and QA is executed on two Pegasus-chip D-Wave quantum annealers. The problems are random Ising models whose connectivity matches heavy-hex graphs and the Pegasus graph connectivity, and optionally include hardware-compatible cubic terms (ZZZ terms). The QAOA circuits are heavily optimized and of extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of the heavy-hex lattice. QAOA and QA are both compared against simulated annealing and the optimal solutions are computed exactly using CPLEX. The noiseless mean QAOA expectation values for p = 1, 2 are computed using classical light-cone based simulations. We find QA outperforms QAOA on the evaluated devices.

15 June 2020
Verified
Book Chapter
Closed access
PDF file
SZStefanie Zbinden
Stefanie Zbinden
ABAndreas Bärtschi
Andreas Bärtschi
HDHristo Djidjev
Hristo Djidjev
SEStephan Eidenbenz
Stephan Eidenbenz