Related papers: Hamiltonian Decoded Quantum Interferometry for Gen…
This paper is devoted to the construction of what we will call {\em exactly solvable models}, i.e. of quantum mechanical systems described by an Hamiltonian $H$ whose eigenvalues and eigenvectors can be explicitly constructed out of some…
Decoherence represents a major obstacle towards realizing reliable quantum technologies. Identifying states that can be uphold against decoherence by purely coherent means, i.e., {\it stabilizable states}, for which the dissipation-induced…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
Nonadiabatic holonomic quantum computation~(NHQC) provides an essential way to construct robust and high-fidelity quantum gates due to its geometric features. However, NHQC is more sensitive to the decay and dephasing errors than…
The preparation of the ground state of a Hamiltonian $H$ with a large spectral radius has applications in many areas such as electronic structure theory and quantum field theory. Given an initial state with a constant overlap with the…
The mechanism of describing quantum states by standard probability (tomographic one) instead of wave function or density matrix is elucidated. Quantum tomography is formulated in an abstract Hilbert space framework, by means of the identity…
Identifying Hamiltonian of a quantum system is of vital importance for quantum information processing. In this Letter, we realized and benchmarked a quantum Hamiltonian identification algorithm recently proposed [Phys. Rev. Lett.…
Mapping the system evolution of a two-state system allows the determination of the effective system Hamiltonian directly. We show how this can be achieved even if the system is decohering appreciably over the observation time. A method to…
We discuss the application of the Jordanian quantum algebra $\mathcal{U}_h (\mathfrak{sl}(2, \mathbb{R}))$, a Hopf algebra deformation of the Lie algebra $\mathfrak{sl}(2, \mathbb{R})$, in order to generate sets of $N$ qubit quantum states.…
We propose a quantum inverse iteration algorithm which can be used to estimate the ground state properties of a programmable quantum device. The method relies on the inverse power iteration technique, where the sequential application of the…
Optimization via decoded quantum interferometry (DQI) has recently gained a great deal of attention as a promising avenue for solving optimization problems using quantum computers. In this paper, we apply DQI to an industrial optimization…
We present general conditions for quantum error suppression for Hamiltonian-based quantum computation using subsystem codes. This involves encoding the Hamiltonian performing the computation using an error detecting subsystem code and the…
We develop and analyze a fault-tolerant quantum algorithm for computing $n$-th order response properties necessary for analysis of non-linear spectroscopies of molecular and condensed phase systems. We use a semi-classical description in…
We describe methods for simulating general second-quantized Hamiltonians using the compact encoding, in which qubit states encode only the occupied modes in physical occupation number basis states. These methods apply to second-quantized…
Hamiltonian quantum computing, such as the adiabatic and holonomic models, can be protected against decoherence using an encoding into stabilizer subspace codes for error detection and the addition of energy penalty terms. This method has…
We propose a variational quantum algorithm to prepare ground states of 1D lattice quantum Hamiltonians specifically tailored for programmable quantum devices where interactions among qubits are mediated by Quantum Data Buses (QDB). For…
Although quantum computing holds promise for solving Combinatorial Optimization Problems (COPs), the limited qubit capacity of NISQ hardware makes large-scale instances intractable. Conventional methods attempt to bridge this gap through…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…
We propose a versatile and efficient algorithmic framework for optimizing fermion-to-qubit mappings by generalizing the idea of randomized block coordinate descent. Our greedy approach, termed Randomized Subsystem Descent, iteratively…
Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify…