Searcharxiv⌕ Search

arXiv subjects

Joaquín Ossorio-Castillo

Publications and source records attributed to Joaquín Ossorio-Castillo.

4 recordsLinked to original sources

Simulating NMR Spectra with a Quantum Computer

The procedure for simulating the nuclear magnetic resonance spectrum linked to the spin system of a molecule for a certain nucleus entails diagonalizing the associated Hamiltonian matrix. As the dimensions of said matrix grow exponentially with respect to the spin system's atom count, the calculation of the eigenvalues and eigenvectors marks the performance of the overall process. The aim of this paper is to provide a formalization of the complete procedure of the simulation of a spin system's NMR spectrum while also explaining how to diagonalize the Hamiltonian matrix with a quantum computer, thus enhancing the overall process's performance. Two well-known quantum algorithms for calculating the eigenvalues of a matrix are analyzed and put to the test in this context: quantum phase estimation and the variational quantum eigensolver. Additionally, we present simulated results for the later approach while also addressing the hypothetical noise found in a physical quantum computer.

quant-ph↗

Further Applications of the Generalised Phase Kick-Back

In our previous work, we defined a quantum algorithmic technique known as the Generalised Phase Kick-Back, or $GPK$, and analysed its applications in generalising some classical quantum problems, such as the Deutsch-Jozsa problem or the Bernstein-Vazirani problem. We also proved that using this technique we can solve Simon's problem in a more efficient manner. In this paper we continue analysing the potential of this technique, defining the concept of $\mathbf{y}$-balanced functions and solving a new problem, which further generalises the generalised Deutsch-Jozsa problem (the fully balanced image problem). This problem also underlines the relation between quantum computation and Boolean function theory, and, in particular, the Walsh and Fourier-Hadamard transforms. We finish our discussion by solving the generalised version of Simon's problem using the $GPK$ algorithm, while analysing the efficiency of this new solution.

quant-ph↗

A Generalisation of the Phase Kick-Back

In this paper, we present a generalisation of the Phase Kick-Back technique, which is central to some of the classical algorithms in quantum computing, such as the Deutsch--Jozsa algorithm, Simon's algorithm or Grover's algorithm. We will begin by recalling the Phase Kick-Back technique to then introduce the new generalised version and analyse it. After that, we will present a new generalised version of the Deutsch--Jozsa problem and it will be solved using the previously defined technique. Finally, we will present a generalised version of the Bernstein-Vazirani problem and solve it using this technique to better understand its inner workings.

quant-ph↗

An adiabatic quantum algorithm for the Frobenius problem

The (Diophantine) Frobenius problem is a well-known NP-hard problem (also called the stamp problem or the chicken nugget problem) whose origins lie in the realm of combinatorial number theory. In this paper we present an adiabatic quantum algorithm which solves it, using the so-called Apéry set of a numerical semigroup, via a translation into a QUBO problem. The algorithm has been specifically designed to run in a D-Wave 2X machine.

math.CO↗