Christian Arenz

Christian Arenz

Auto-generated profile, based on publicly available information

Christian Arenz

Arizona State University

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
12 January 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
AMAlicia B. Magann
Alicia B. Magann
CAChristian Arenz
Christian Arenz
MGMatthew D. Grace
Matthew D. Grace
THTak-San Ho
Tak-San Ho
RKRobert L. Kosut
Robert L. Kosut
MSMohan Sarovar
Mohan Sarovar
The last decade has witnessed remarkable progress in the development of quantum technologies. Although fault-tolerant devices likely remain years away, the noisy intermediate-scale quantum devices of today may be leveraged for other purposes. Leading candidates are variational quantum algorithms (VQAs), which have been developed for applications including chemistry, optimization, and machine learning, but whose implementations on quantum devices have yet to demonstrate improvements over classical capabilities. In this Perspective, we propose a variety of ways that the performance of VQAs could be informed by quantum optimal control theory. A major theme throughout is the need for sufficient control resources in VQA implementations; we discuss different ways this need can manifest, outline a variety of open questions, and look to the future.

2 September 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
JLJuneseo Lee
Juneseo Lee
AMAlicia B. Magann
Alicia B. Magann
HRHershel Rabitz
Hershel Rabitz
CAChristian Arenz
Christian Arenz
The performance of variational quantum algorithms relies on the success of using quantum and classical computing resources in tandem. Here, we study how these quantum and classical components interrelate. In particular, we focus on algorithms for solving the combinatorial optimization problem MaxCut, and study how the structure of the classical optimization landscape relates to the quantum circuit used to evaluate the MaxCut objective function. In order to analytically characterize the impact of quantum features on the critical points of the landscape, we consider a family of quantum circuit ansätze composed of mutually commuting elements. We identify multiqubit operations as a key resource and show that overparameterization allows for obtaining favorable landscapes. Namely, we prove that an ansatz from this family containing exponentially many variational parameters yields a landscape free of local optima for generic graphs. However, we further prove that these ansätze do not offer superpolynomial advantages over purely classical MaxCut algorithms. We then present a series of numerical experiments illustrating that noncommutativity and entanglement are important features for improving algorithm performance.

1 October 2017 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
CAChristian Arenz
Christian Arenz
BRBenjamin Russell
Benjamin Russell
DBDaniel Burgarth
Daniel Burgarth
HRHerschel Rabitz
Herschel Rabitz
In this work we derive a lower bound for the minimum time required to implement a target unitary transformation through a classical time-dependent field in a closed quantum system. The bound depends on the target gate, the strength of the internal Hamiltonian and the highest permitted control field amplitude. These findings reveal some properties of the reachable set of operations, explicitly analyzed for a single qubit. Moreover, for fully controllable systems, we identify a lower bound for the time at which all unitary gates become reachable. We use numerical gate optimization in order to study the tightness of the obtained bounds. It is shown that in the single qubit case our analytical findings describe the relationship between the highest control field amplitude and the minimum evolution time remarkably well. Finally, we discuss both challenges and ways forward for obtaining tighter bounds for higher dimensional systems, offering a discussion about the mathematical form and the physical meaning of the bound.

17 April 2024 in PRX Quantum
Verified
Journal Article
Open access
PDF file
SBS. C. Burd
S. C. Burd
HKH. M. Knaack
H. M. Knaack
RSR. Srinivas
R. Srinivas
CAC. Arenz
C. Arenz
ACA. L. Collopy
A. L. Collopy
DSD. H. Slichter
D. H. Slichter
We show experimentally that a broad class of interactions involving quantum harmonic oscillators can be made stronger (amplified) using a unitary squeezing protocol. While our demonstration uses the motional and internal states of a single trapped 25Mg+ ion, the scheme applies generally to Hamiltonians involving just a single harmonic oscillator as well as Hamiltonians coupling the oscillator to another quantum degree of freedom such as a qubit, covering a large range of systems of interest in quantum information and metrology applications. Importantly, the protocol does not require knowledge of the parameters of the Hamiltonian to be amplified, nor does it require a well-defined phase relationship between the squeezing interaction and the rest of the system dynamics, making it potentially useful in instances where certain aspects of a signal or interaction may be unknown or uncontrolled, such as searches for novel forms of dark matter.

29 September 2023 in Physical Review Research
Verified
Journal Article
Open access
PDF file
AMAlicia B. Magann
Alicia B. Magann
SESophia E. Economou
Sophia E. Economou
CAChristian Arenz
Christian Arenz
We develop an adaptive method for quantum state preparation that utilizes randomness as an essential component and that does not require classical optimization. Instead, a cost function is minimized to prepare a desired quantum state through an adaptively constructed quantum circuit, where each adaptive step is informed by feedback from gradient measurements in which the associated tangent space directions are randomized. We provide theoretical arguments and numerical evidence that convergence to the target state can be achieved for almost all initial states. We investigate different randomization procedures and develop lower bounds on the expected cost function change, which allows for drawing connections to barren plateaus and for assessing the applicability of the algorithm to large-scale problems.

3 March 2017 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Open access
PDF file
CAChristian Arenz
Christian Arenz
DBDaniel Burgarth
Daniel Burgarth
RHRobin Hillier
Robin Hillier
For finite-dimensional quantum systems, such as qubits, a well established strategy to protect such systems from decoherence is dynamical decoupling. However many promising quantum devices, such as oscillators, are infinite dimensional, for which the question if dynamical decoupling could be applied remained open. Here we first show that not every infinite-dimensional system can be protected from decoherence through dynamical decoupling. Then we develop dynamical decoupling for continuous variable systems which are described by quadratic Hamiltonians. We identify a condition and a set of operations that allow us to map a set of interacting harmonic oscillators onto a set of non-interacting oscillators rotating with an averaged frequency, a procedure we call homogenization. Furthermore we show that every quadratic system-environment interaction can be suppressed with two simple operations acting only on the system. Using a random dynamical decoupling or homogenization scheme, we develop bounds that characterize how fast we have to work in order to achieve the desired uncoupled dynamics. This allows us to identify how well homogenization can be achieved and decoherence can be suppressed in continuous variable systems.