Related papers: Leveraging commuting groups for an efficient varia…
Efficient and effective compilation of quantum circuits remains an important aspect of executing quantum programs. In this paper, we propose a generic compilation framework particularly suitable for limited connectivity, that extends many…
We provide several examples and an intuitive diagrammatic representation demonstrating the use of two-qubit unitary transformations for mapping coupled spin Hamiltonians to simpler ones and vice versa. The corresponding dualities may be…
Clustering is a fundamental task in data science that aims to group data based on their similarities. However, defining similarity is often ambiguous, making it challenging to determine the most appropriate objective function for a given…
Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate…
Quantum computation represents a revolutionary approach for solving problems in quantum chemistry. However, due to the limited quantum resources in the current noisy intermediate-scale quantum (NISQ) devices, quantum algorithms for large…
Clifford group lies at the core of quantum computation -- it underlies quantum error correction, its elements can be used to perform magic state distillation and they form randomized benchmarking protocols, Clifford group is used to study…
The accurate first-principles description of strongly-correlated materials is an important and challenging problem in condensed matter physics. Ab initio downfolding has emerged as a way of deriving compressed many-body Hamiltonians that…
In this work, we present a new algorithm for generating quantum circuits that efficiently implement continuous time quantum walks on arbitrary simple sparse graphs. The algorithm, called matching decomposition, works by decomposing a…
Achieving chemical accuracy with shallow quantum circuits is a significant challenge in quantum computational chemistry, particularly for near-term quantum devices. In this work, we present a Clifford-based Hamiltonian engineering…
We provide new constructions of unitary $t$-designs for general $t$ on one qudit and $N$ qubits, and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time, as a basic…
Unit commitment is an important optimization problem in power system operations, classified as NP-hard. This paper presents a hybrid quantum-classical method for the unit commitment problem with time-dependent constraints, where decisions…
We develop a method to deduce the symmetry properties of many-body Hamiltonians when they are prepared in Jordan-Wigner form for evaluation on quantum computers. Symmetries, such as point-group symmetries in molecules, are apparent in the…
Measuring the expectation value of Pauli operators on prepared quantum states is a fundamental task in a multitude of quantum algorithms. Simultaneously measuring sets of operators allows for fewer measurements and an overall speedup of the…
Clifford quantum circuits are elementary invertible transformations of quantum systems that map Pauli operators to Pauli operators. We study periodic one-parameter families of Clifford circuits, called loops of Clifford circuits, acting on…
With the fast development of quantum technology, the sizes of both digital and analog quantum systems increase drastically. In order to have better control and understanding of the quantum hardware, an important task is to characterize the…
The variational quantum eigensolver has been proposed as a low-depth quantum circuit that can be employed to examine strongly correlated systems on today's noisy intermediate-scale quantum computers. We examine details associated with the…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
We present a general method which expresses a unitary operator by the product of operators allowed by the Hamiltonian of spin-1/2 systems. In this method, the generator of an operator is found first, and then the generator is expanded by…
We introduce a framework for the calculation of ground and excited state energies of bosonic systems suitable for near-term quantum devices and apply it to molecular vibrational anharmonic Hamiltonians. Our method supports generic reference…
Simultaneous measurement of multiple Pauli strings (tensor products of Pauli matrices) is the basis for efficient measurement of observables on quantum computers by partitioning the observable into commuting sets of Pauli strings. We…