A5030214413- Quantum Computing Algorithms and Architecture
- Quantum Information and Cryptography
- Quantum and electron transport phenomena
- Quantum many-body systems
- Cloud Computing and Resource Management
- Mathematical Approximation and Integration
- Spectroscopy and Quantum Chemical Studies
- Advanced Chemical Physics Studies
- Machine Learning in Materials Science
- Matrix Theory and Algorithms
- Graphene research and applications
- Spectral Theory in Mathematical Physics
- Molecular Junctions and Nanostructures
- Cold Atom Physics and Bose-Einstein Condensates
- Quantum-Dot Cellular Automata
University of Waterloo
2019-2025
Particle physics describes the interplay of matter and forces through gauge theories. Yet, intrinsic quantum nature theories makes important problems notoriously difficult for classical computational techniques. Quantum computers offer a promising way to overcome these roadblocks. We demonstrate two essential requirements on this path: first, we perform computation properties basic building block two-dimensional lattice electrodynamics, involving both fields matter. Second, show how refine...
The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring system will become increasingly demanding, particularly for variational protocols that require extensive sampling. Here, we introduce measurement scheme adaptively modifies estimator based previously obtained data. Our algorithm, which call AEQuO, continuously monitors both estimated average and associated error considered observable, determines next step this information....
Measuring the expectation value of Pauli operators on prepared quantum states is a fundamental task in multitude algorithms. Simultaneously measuring sets allows for fewer measurements and an overall speedup measurement process. We investigate partitioning random subset into simultaneously-measurable parts. Using heuristics from coloring graphs, we give upper bound expected number parts our partition. go to conjecture that allowing arbitrary Clifford before measurement, rather than...
Quantum computers are expected to surpass the computational capabilities of classical during this decade, and achieve disruptive impact on numerous industry sectors, particularly finance. In fact, finance is estimated be first sector benefit from Computing not only in medium long terms, but even short term. This review paper presents state art quantum algorithms for financial applications, with particular focus those use cases that can solved via Machine Learning.
In the last years, we have been witnessing a tremendous push to demonstrate that quantum computers can solve classically intractable problems. This effort, initially focused on hardware, progressively included simplification of models be simulated. We consider Hamiltonians written in terms Pauli operators and systematically cut all qubits are not essential simulate system. Our approach is universally applicable lowers complexity by first ensuring largest possible portion Hilbert space...
Quantum computing is in its greatest upswing, with so-called noisy-intermediate-scale-quantum devices heralding the computational power to be expected near future. While field progressing toward quantum advantage, computers already have potential tackle classically intractable problems. Here, we consider gauge theories describing fundamental-particle interactions. On way their full-fledged simulations, challenge of limited resources on near-term has overcome. We propose an experimental...
Particle physics underpins our understanding of the world at a fundamental level by describing interplay matter and forces through gauge theories. Yet, despite their unmatched success, intrinsic quantum mechanical nature theories makes important problem classes notoriously difficult to address with classical computational techniques. A promising way overcome these roadblocks is offered computers, which are based on same laws that make computations so difficult. Here, we present computation...
Measuring the expectation value of Pauli operators on prepared quantum states is a fundamental task in multitude algorithms. Simultaneously measuring sets allows for fewer measurements and an overall speedup measurement process. Using results from coloring random graphs, we give evidence upper bound expected minimum number simultaneously measurable parts necessary to partition set operators. By expanding our gate allow multiqubit Clifford gates before measurement, were able cut down...
Quantum computers are expected to surpass the computational capabilities of classical during this decade, and achieve disruptive impact on numerous industry sectors, particularly finance. In fact, finance is estimated be first sector benefit from Computing not only in medium long terms, but even short term. This review paper presents state art quantum algorithms for financial applications, with particular focus those use cases that can solved via Machine Learning.
The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring system will become increasingly demanding, particularly for variational protocols that require extensive sampling. Here, we introduce measurement scheme adaptively modifies estimator based previously obtained data. Our algorithm, which call AEQuO, continuously monitors both estimated average and associated error considered observable, determines next step this information....
We present an efficient method for construction of a fully anticommutative set Pauli generators (elements the group) from commutative operators that are composed exclusively x̂ (purely X generators) and sorted by associated numerical measure, such as absolute energy gradients. Our approach uses Gauss–Jordan elimination applied to binary matrix encodes bring it reduced row-echelon form, followed system in standard basis means modified Jordan–Wigner transformation returning original basis. The...
Graph states are the key resources for measurement- and fusion-based quantum computing with photons, yet their creation is experimentally challenging. We optimize a hybrid graph-state generation scheme using single emitter linear optics Bell-state measurements, called fusions. first generate restricted class of from then apply fusions to create target graph state, where we use dynamic programming approach find construction that requires lowest possible number Our analysis yields lookup table...
We present an efficient method for construction of a fully anti-commutative set Pauli generators (elements the group) from commutative operators that are composed exclusively $\hat x_i$ (purely X generators) and sorted by associated numerical measure, such as absolute energy gradients. Our approach uses Gauss-Jordan elimination applied to binary matrix encodes bring it reduced row echelon form, followed system in standard basis means modified Jordan-Wigner transformation returning original...
In the last years, we have been witnessing a tremendous push to demonstrate that quantum computers can solve classically intractable problems. This effort, initially focused on hardware, progressively included simplification of models be simulated. We consider Hamiltonians written in terms Pauli operators and systematically cut all qubits are not essential simulate system. Our approach is universally applicable lowers complexity by first ensuring largest possible portion Hilbert space...