Harnessing Quantum Systems for Sensing, Simulation, and Optimization

Quantum information science offers a remarkable promise: by thinking practically about how quantum systems can be put to work to solve computational and information processing tasks, we gain novel insights into the foundations of quantum theory and computer science. Or, conversely, by (re)considering the fundamental physical building blocks of computers and sensors, we enable new technologies, with major impacts for computational and experimental physics.

Symmetric-Key Cryptography and Query Complexity in the Quantum World

Quantum computers are likely to have a significant impact on cryptography. Many commonly used cryptosystems will be completely broken once large quantum computers are available. Since quantum computers can solve the factoring problem in polynomial time, the security of RSA would not hold against quantum computers. For symmetric-key cryptosystems, the primary quantum attack is key recovery via Grover search, which provides a quadratic speedup. One way to address this is to double the key length.

Theoretical and Practical High-Assurance Software Tools for Quantum Applications

Quantum computing promises to transform our approach to solving significant computational challenges, such as factorization and quantum system simulation. Harnessing this quantum power in real life necessitates software stack support. This talk focuses on the critical challenges encountered in the software for quantum computing, aiming to shape high-assurance software stacks for controlling quantum computing devices in the immediate future and beyond.

Quantum algorithms for nonconvex optimization: theory and implementation

Continuous optimization problems arise in virtually all disciplines of quantitative research, including applied mathematics, computer science, and operations research. While convex optimization has been well studied in the past decades, nonconvex optimization generally remains intractable in theory and practice. Quantum computers, an emerging technology that exploits quantum physics for information processing, could pave an unprecedented path toward nonconvex optimization.

Quantum Enhanced Impulse Measurements and Their Applications in Searches for Dark Matter

Optomechanical systems have enabled a variety of novel sensors that transduce an external force on a mechanical sensor to an optical signal which can be read out through different measurement techniques. Based on recent advances in these sensing technologies, we suggest that heavy dark matter candidates around the Planck mass range could be detected solely through their gravitational interaction.

Phase Transitions in Random Quantum Circuits

Random Circuits have emerged as an invaluable tool in the quantum mechanics’ toolkit. On one hand, the task of sampling outputs from a random circuit has established itself as a leading contender to experimentally demonstrate the intrinsic superiority of quantum computers using near-term, noisy platforms. On the other hand, random circuits have also been used to deduce far-reaching conclusions about the theoretical foundations of quantum information and communication.

Quantum Simulation and Dynamics with Synthetic Quantum Matter

Significant advancements in controlling and manipulating individual quantum degrees of freedom have paved the way for the development of programmable strongly-interacting quantum many-body systems. Quantum simulation emerges as one of the most promising applications of these systems, offering insights into complex natural phenomena that would otherwise be difficult to explore.

Variational Algorithms and Resources for Near-Term Quantum Simulation

The difficulty of efficiently simulating quantum many-body systems was one of the first motivations for developing quantum computers and may also be one of the first applications to find practical computational advantage on real quantum hardware. With the relatively recent advent of publicly available quantum technologies, we have now entered the era of noisy intermediate-scale quantum (NISQ) computing.

Optimization Problems in Quantum Machine Learning: when are variational algorithms trainable

The variational algorithm is a paradigm for designing quantum procedures implementable on noisy intermediate-scale quantum (NISQ) machines. It is viewed as a promising candidate for demonstrating practical quantum advantage.

In this dissertation, we look into the optimization aspect of the variational quantum algorithms as an attempt to answer when and why a variational quantum algorithm works. We mainly focus on two instantiations of the family of variational algorithms, the Variational Quantum Eigensolvers (VQEs) and the Quantum Neural Networks (QNNs).