Related papers: Quantum circuit synthesis for fermionic excitation…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
We present a review of the Unitary Coupled Cluster (UCC) ansatz and related ans\"atze which are used to variationally solve the electronic structure problem on quantum computers. A brief history of coupled cluster (CC) methods is provided,…
Molecular quantum simulations with the variational quantum eigensolver (VQE) rely on ansatz states that approximate the molecular ground states. These ansatz states are generally defined by parametrized fermionic excitation operators and an…
In quantum field theory, particle creation occurs, in general, when an intense external field, such as an electromagnetic field, breaks time translational invariance. This leads to an ambiguity in the definition of the vacuum state. In…
Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are geometric in nature, we provide a quantum algorithm that efficiently approximates the colored Jones polynomial. The construction is based on…
The Jaynes-Cummings model describes the coupling between photons and a single two-level atom in a simplified representation of light-matter interactions. In circuit QED, this model is implemented by combining microwave resonators and…
Quantum programs are notoriously difficult to code and verify due to unintuitive quantum knowledge associated with quantum programming. Automated tools relieving the tedium and errors associated with low-level quantum details would hence be…
In this work, we introduce new methods for the quantization, decomposition, and extraction (from electromagnetic simulations) of lumped-element circuit models for superconducting quantum devices. Our flux-charge symmetric procedures center…
The operator algebra of fermionic modes is isomorphic to that of qubits, the difference between them is twofold: the embedding of subalgebras corresponding to mode subsets and multiqubit subsystems on the one hand, and the parity…
We revisit the Jordan-Wigner transformation, showing that --rather than a non-local isomorphism between different fermionic and spin Hamiltonian operators-- it can be viewed in terms of local identities relating different realizations of…
The process of translating a quantum algorithm into a form suitable for implementation on a quantum computing platform is crucial but yet challenging. This entails specifying quantum operations with precision, a typically intricate task. In…
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step…
We demonstrate that quantum coherence can be generated by the interplay of coupling to an incoherent environment and kinetic processes. This joint effect even occurs in a repulsively interacting fermionic system initially prepared in an…
We provide a simple framework for the synthesis of quantum circuits based on a numerical optimization algorithm. This algorithm is used in the context of the trapped-ions technology. We derive theoretical lower bounds for the number of…
In this paper, we have developed a unitary variant of a double exponential coupled cluster theory, which is capable of mimicking the effects of connected excitations of arbitrarily high rank, using only rank-one and rank-two parametrization…
Quantum simulation of chemical Hamiltonians enables the efficient calculation of chemical properties. Mapping is one of the essential steps in simulating fermionic systems on quantum computers. In this work, a unified framework of…
The quantum circuit synthesis problem bridges quantum algorithm design and quantum hardware implementation in the Noisy Intermediate-Scale Quantum (NISQ) era. In quantum circuit synthesis problems, diagonal unitary synthesis plays a crucial…
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework…
The proposed framework represents the first tool to compile a quantum circuit across photonic-connected distributed quantum processors. Its design follows a divide-and-conquer paradigm for circuit partitioning, transpilation, and assembly,…
The design of efficient quantum circuits is an important issue in quantum computing. It is in general a formidable task to find a highly optimized quantum circuit for a given unitary matrix. We propose a quantum circuit design method that…