Mária Kieferová

Mária Kieferová

Auto-generated profile, based on publicly available information

Mária Kieferová

University of Technology Sydney

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
30 August 2019 in Chemical Reviews
Verified
Journal Article
Closed access
YCYudong Cao
Yudong Cao
JRJonathan Romero
Jonathan Romero
JOJonathan P. Olson
Jonathan P. Olson
MDMatthias Degroote
Matthias Degroote
PJPeter D. Johnson
Peter D. Johnson
AAAlán Aspuru-Guzik
Alán Aspuru-Guzik

22 December 2017 in Physical Review A
Verified
Journal Article
Open access
PDF file
MKMária Kieferová
Mária Kieferová
NWNathan Wiebe
Nathan Wiebe
The promise of quantum neural nets, which utilize quantum effects to model complex data sets, has made their development an aspirational goal for quantum machine learning and quantum computing in general. Here we provide methods of training quantum Boltzmann machines. Our work generalizes existing methods and provides additional approaches for training quantum neural networks that compare favorably to existing methods. We further demonstrate that quantum Boltzmann machines enable a form of partial quantum state tomography that further provides a generative model for the input quantum state. Classical Boltzmann machines are incapable of this. This verifies the long-conjectured connection between tomography and quantum machine learning. Finally, we prove that classical computers cannot simulate our training process in general unless BQP=BPP, provide lower bounds on the complexity of the training procedures and numerically investigate training for small nonstoquastic Hamiltonians.

2 May 2018 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
DBDominic W. Berry
Dominic W. Berry
MKMária Kieferová
Mária Kieferová
ASArtur Scherer
Artur Scherer
YSYuval R. Sanders
Yuval R. Sanders
GLGuang Hao Low
Guang Hao Low
RBRyan Babbush
Ryan Babbush
Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We present three techniques for reducing the cost of preparing fermionic Hamiltonian eigenstates using phase estimation. First, we report a polylogarithmic-depth quantum algorithm for antisymmetrizing the initial states required for simulation of fermions in first quantization. This is an exponential improvement over the previous state-of-the-art. Next, we show how to reduce the overhead due to repeated state preparation in phase estimation when the goal is to prepare the ground state to high precision and one has knowledge of an upper bound on the ground state energy that is less than the excited state energy (often the case in quantum chemistry). Finally, we explain how one can perform the time evolution necessary for the phase estimation based preparation of Hamiltonian eigenstates with exactly zero error by using the recently introduced qubitization procedure.

31 July 2012 in Physical Review Letters
Verified
Journal Article
Open access
PDF file
RSRolando D. Somma
Rolando D. Somma
DNDaniel Nagaj
Daniel Nagaj
MKMária Kieferová
Mária Kieferová
We study the glued-trees problem from A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. Spielman, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (ACM, San Diego, CA, 2003), p. 59. in the adiabatic model of quantum computing and provide an annealing schedule to solve an oracular problem exponentially faster than classically possible. The Hamiltonians involved in the quantum annealing do not suffer from the so-called sign problem. Unlike the typical scenario, our schedule is efficient even though the minimum energy gap of the Hamiltonians is exponentially small in the problem size. We discuss generalizations based on initial-state randomization to avoid some slowdowns in adiabatic quantum computing due to small gaps.

5 April 2019 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MKMária Kieferová
Mária Kieferová
ASArtur Scherer
Artur Scherer
DBDominic W. Berry
Dominic W. Berry
We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model-based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the earlier proposal by Berry et al. [ Phys. Rev. Lett. 114, 090502 (2015)] to evolution generated by explicitly time-dependent Hamiltonians. Two alternative strategies are proposed to implement time ordering while exploiting the superposition principle for sampling the Hamiltonian at different times. The resource cost of our simulation algorithm retains the optimal logarithmic dependence on the inverse of the desired precision.

2 January 2023 in Applied Physics Letters
Verified
Journal Article
Closed access
PDF file
TWTheodore White
Theodore White
AOAlex Opremcak
Alex Opremcak
GSGeorge Sterling
George Sterling
AKAlexander Korotkov
Alexander Korotkov
DSDaniel Sank
Daniel Sank
ONOfer Naaman
Ofer Naaman
We demonstrate a high dynamic range Josephson parametric amplifier (JPA) in which the active nonlinear element is implemented using an array of rf-SQUIDs. The device is matched to the 50 Ω environment with a Klopfenstein-taper impedance transformer and achieves a bandwidth of 250–300 MHz with input saturation powers up to −95 dBm at 20 dB gain. A 54-qubit Sycamore processor was used to benchmark these devices, providing a calibration for readout power, an estimation of amplifier added noise, and a platform for comparison against standard impedance matched parametric amplifiers with a single dc-SQUID. We find that the high power rf-SQUID array design has no adverse effect on system noise, readout fidelity, or qubit dephasing, and we estimate an upper bound on amplifier added noise at 1.6 times the quantum limit. Finally, amplifiers with this design show no degradation in readout fidelity due to gain compression, which can occur in multi-tone multiplexed readout with traditional JPAs.