Eleanor Rieffel

Dr. Eleanor Rieffel


Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

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

Representative Publications

View All Publications
12 February 2019 in Algorithms
Verified
Journal Article
Open access
PDF file
SHStuart Hadfield
Stuart Hadfield
ZWZhihui Wang
Zhihui Wang
BOBryan O’gorman
Bryan O’gorman
EREleanor Rieffel
Eleanor Rieffel
DVDavide Venturelli
Davide Venturelli
RBRupak Biswas
Rupak Biswas
The next few years will be exciting as prototype universal quantum processors emerge, enabling the implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation and which have the potential to significantly expand the breadth of applications for which quantum computers have an established advantage. A leading candidate is Farhi et al.’s quantum approximate optimization algorithm, which alternates between applying a cost function based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between more general families of operators. The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter. This ansatz supports the representation of a larger, and potentially more useful, set of states than the original formulation, with potential long-term impact on a broad array of application areas. For cases that call for mixing only within a desired subspace, refocusing on unitaries rather than Hamiltonians enables more efficiently implementable mixers than was possible in the original framework. Such mixers are particularly useful for optimization problems with hard constraints that must always be satisfied, defining a feasible subspace, and soft constraints whose violation we wish to minimize. More efficient implementation enables earlier experimental exploration of an alternating operator approach, in the spirit of the quantum approximate optimization algorithm, to a wide variety of approximate optimization, exact optimization, and sampling problems. In addition to introducing the quantum alternating operator ansatz, we lay out design criteria for mixing operators, detail mappings for eight problems, and provide a compendium with brief descriptions of mappings for a diverse array of problems.

14 December 2014 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
EREleanor Rieffel
Eleanor Rieffel
DVDavide Venturelli
Davide Venturelli
BOBryan O’gorman
Bryan O’gorman
MDMinh B. Do
Minh B. Do
EPElicia M. Prystay
Elicia M. Prystay
VSVadim N. Smelyanskiy
Vadim N. Smelyanskiy

18 February 2017 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
ZJZhang Jiang
Zhang Jiang
EREleanor Rieffel
Eleanor Rieffel

24 May 2023 in Remote Sensing
Verified
Journal Article
Open access
PDF file
AAAta Akbari Asanjan
Ata Akbari Asanjan
Milad MemarzadehMilad Memarzadeh
Milad Memarzadeh
PLPaul Aaron Lott
Paul Aaron Lott
EREleanor Rieffel
Eleanor Rieffel
SGShon Grabbe
Shon Grabbe
Wildfires are one of the major disasters among many and are responsible for more than 6 million acres burned in the United States alone every year. Accurate, insightful, and timely wildfire detection is needed to help authorities mitigate and prevent further destruction. Uncertainty quantification is always a crucial part of the detection of natural disasters, such as wildfires, and modeling products can be misinterpreted without proper uncertainty quantification. In this study, we propose a supervised deep generative machine-learning model that generates stochastic wildfire detection, allowing fast and comprehensive uncertainty quantification for individual and collective events. In the proposed approach, we also aim to address the patchy and discontinuous Moderate Resolution Imaging Spectroradiometer (MODIS) wildfire product by training the proposed model with MODIS raw and combined bands to detect fire. This approach allows us to generate diverse but plausible segmentations to represent the disagreements regarding the delineation of wildfire boundaries by subject matter experts. The proposed approach generates stochastic segmentation via two model streams in which one learns meaningful stochastic latent distributions, and the other learns the visual features. Two model branches join eventually to become a supervised stochastic image-to-image wildfire detection model. The model is compared to two baseline stochastic machine-learning models: (1) with permanent dropout in training and test phases and (2) with Stochastic ReLU activations. The visual and statistical metrics demonstrate better agreements between the ground truth and the proposed model segmentations. Furthermore, we used multiple scenarios to evaluate the model comprehension, and the proposed Probabilistic U-Net model demonstrates a better understanding of the underlying physical dynamics of wildfires compared to the baselines.

11 July 2023 in Algorithms
Verified
Journal Article
Open access
PDF file
PKPhillip Alexander Kerger
Phillip Alexander Kerger
DNDavid Bernal Neira
David Bernal Neira
ZIZoe Gonzalez Izquierdo
Zoe Gonzalez Izquierdo
EREleanor Rieffel
Eleanor Rieffel
We present two algorithms in the quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability: one for producing an approximately optimal Steiner tree, and one for producing an exact directed minimum spanning tree, each of which uses O˜(n1/4) rounds of communication and O˜(n9/4) messages, achieving a lower asymptotic round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. At a high level, we achieve these results by combining classical algorithmic frameworks with quantum subroutines. Additionally, we characterize the constants and logarithmic factors involved in our algorithms as well as related classical algorithms, otherwise obscured by O˜ notation, revealing that advances are needed to render both the quantum and classical algorithms practical.

28 September 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
HLHannes Leipold
Hannes Leipold
Federico M SpedalieriFederico M Spedalieri
Federico M Spedalieri
EREleanor Rieffel
Eleanor Rieffel
The quantum alternating operator ansatz (QAOA) and constrained quantum annealing (CQA) restrict the evolution of a quantum system to remain in a constrained space, often with a dimension much smaller than the whole Hilbert space. A natural question when using quantum annealing or a QAOA protocol to solve an optimization problem is to select an initial state for the wavefunction and what operators to use to evolve it into a solution state. In this work, we construct several ansatzes tailored to solve the combinational circuit fault diagnostic (CCFD) problem in different subspaces related to the structure of the problem, including superpolynomially smaller subspaces than the whole Hilbert space. We introduce a family of dense and highly connected circuits that include small instances but can be scaled to larger sizes as a useful collection of circuits for comparing different quantum algorithms. We compare the different ansätzes on instances randomly generated from this family under different parameter selection methods. The results support that ansätzes more closely tailored to exploiting the structure of the underlying optimization problems can have better performance than more generic ansätzes.