arXiv subjects

Edgar Andres Ruiz Guzman

Publications and source records attributed to Edgar Andres Ruiz Guzman.

7 recordsLinked to original sources

arXiv2025

Quantum feature encoding optimization

Quantum Machine Learning (QML) holds the promise of enhancing machine learning modeling in terms of both complexity and accuracy. A key challenge in this domain is the encoding of input data, which plays a pivotal role in determining the performance of QML models. In this work, we tackle a largely unaddressed aspect of encoding that is unique to QML modeling -- rather than adjusting the ansatz used for encoding, we consider adjusting how data is conveyed to the ansatz. We specifically implement QML pipelines that leverage classical data manipulation (i.e., ordering, selecting, and weighting features) as a preprocessing step, and evaluate if these aspects of encoding can have a significant impact on QML model performance, and if they can be effectively optimized to improve performance. Our experimental results, applied across a wide variety of data sets, ansatz, and circuit sizes, with a representative QML approach, demonstrate that by optimizing how features are encoded in an ansatz we can substantially and consistently improve the performance of QML models, making a compelling case for integrating these techniques in future QML applications. Finally we demonstrate the practical feasibility of this approach by running it using real quantum hardware with 100 qubit circuits and successfully achieving improved QML modeling performance in this case as well.

quant-ph↗

arXiv2024

Efficient solution of the non-unitary time-dependent Schrodinger equation on a quantum computer with complex absorbing potential

We explore the possibility of adding complex absorbing potential at the boundaries when solving the one-dimensional real-time Schrödinger evolution on a grid using a quantum computer with a fully quantum algorithm described on a $n$ qubit register. Due to the complex potential, the evolution mixes real- and imaginary-time propagation and the wave function can potentially be continuously absorbed during the time propagation. We use the dilation quantum algorithm to treat the imaginary-time evolution in parallel to the real-time propagation. This method has the advantage of using only one reservoir qubit at a time, that is measured with a certain success probability to implement the desired imaginary-time evolution. We propose a specific prescription for the dilation method where the success probability is directly linked to the physical norm of the continuously absorbed state evolving on the mesh. We expect that the proposed prescription will have the advantage of keeping a high probability of success in most physical situations. Applications of the method are made on one-dimensional wave functions evolving on a mesh. Results obtained on a quantum computer identify with those obtained on a classical computer. We finally give a detailed discussion on the complexity of implementing the dilation matrix. Due to the local nature of the potential, for $n$ qubits, the dilation matrix only requires $2^n$ CNOT and $2^n$ unitary rotation for each time step, whereas it would require of the order of $4^{n+1}$ C-NOT gates to implement it using the best-known algorithm for general unitary matrices.

quant-ph↗

arXiv2023

Restoring symmetries in quantum computing using Classical Shadows

We introduce a method to enforce some symmetries starting from a trial wave-function prepared on quantum computers that might not respect these symmetries. The technique eliminates the necessity for performing the projection on the quantum computer itself. Instead, this task is conducted as a post-processing step on the system's "Classical Shadow". Illustrations of the approach are given for the parity, particle number, and spin projectors that are of particular interest in interacting many-body systems. We compare the method with another classical post-processing technique based on direct measurements of the quantum register. We show that the present scheme can be competitive to predict observables on symmetry-restored states once optimization through derandomization is employed. The technique is illustrated through its application to compute the projected energy for the pairing model Hamiltonian.

quant-ph↗

arXiv2023

Quantum computing with and for many-body physics

Quantum computing technologies are making steady progress. This has opened new opportunities for tackling problems whose complexity prevents their description on classical computers. A prototypical example of these complex problems are interacting quantum many-body systems: on the one hand, these systems are known to become rapidly prohibitive to describe using classical computers when their size increases. On the other hand, these systems are precisely those which are used in the laboratory to build quantum computing platforms. This arguably makes them one of the most promising early use cases of quantum computing. In this review, we explain how quantum many-body systems are used to build quantum processors, and how, in turn, current and future quantum processors can be used to describe large many-body systems of fermions such as electrons and nucleons. The review includes an introduction to analog and digital quantum devices, the mapping of Fermi systems and their Hamiltonians onto qubit registers, as well as an overview of methods to access their static and dynamical properties. We also highlight some aspects related to entanglement, and touch on the description, influence and processing of decoherence in quantum devices.

quant-ph↗

arXiv2022

Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective

We discuss here some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are reviewed. After briefly discussing some of the standard symmetries relevant for many-particle systems, we discuss the advantage of encoding some symmetries directly in quantum ansätze, especially to reduce the quantum register size. It is, however, well-known that the use of symmetry-breaking states can also be a unique way to incorporate specific internal correlations when a spontaneous symmetry breaking occurs. These aspects are discussed in the quantum computing context. Ultimately, an accurate description of quantum systems can be achieved only when the initially broken symmetries are properly restored. We review several methods explored previously to perform symmetry restoration on a quantum computer, for instance, the ones based on symmetry filtering by quantum phase estimation and by an iterative independent set of Hadamard tests. We propose novel methods that pave the new directions to perform symmetry restoration, like those based on the purification of the state employing the linear combination of unitaries (LCU) approach.

quant-ph↗

arXiv2022

Restoring broken symmetries using oracles

We present a new method to perform variation after projection in many-body systems on quantum computers that does not require performing explicit projection. The technique employs the notion of ``oracle'', generally used in quantum search algorithms. We show how to construct the oracle and the projector associated with a symmetry operator. The procedure is illustrated for the parity, particle number, and total spin symmetries. The oracle is used to restore symmetry by indirect measurements using a single ancillary qubit. An Illustration of the technique is made to obtain the approximate ground state energy for the pairing model Hamiltonian.

quant-ph↗

arXiv2021

Calculation of generating function in many-body systems with quantum computers: technical challenges and use in hybrid quantum-classical methods

The generating function of a Hamiltonian $H$ is defined as $F(t)=\langle e^{-itH}\rangle$, where $t$ is the time and where the expectation value is taken on a given initial quantum state. This function gives access to the different moments of the Hamiltonian $\langle H^{K}\rangle$ at various orders $K$. The real and imaginary parts of $F(t)$ can be respectively evaluated on quantum computers using one extra ancillary qubit with a set of measurement for each value of the time $t$. The low cost in terms of qubits renders it very attractive in the near term period where the number of qubits is limited. Assuming that the generating function can be precisely computed using quantum devices, we show how the information content of this function can be used a posteriori on classical computers to solve quantum many-body problems. Several methods of classical post-processing are illustrated with the aim to predict approximate ground or excited state energies and/or approximate long-time evolutions. This post-processing can be achieved using methods based on the Krylov space and/or on the $t$-expansion approach that is closely related to the imaginary time evolution. Hybrid quantum-classical calculations are illustrated in many-body interacting systems using the pairing and Fermi-Hubbard models.

quant-ph↗