Marko Rancic

Dr. Marko Rancic


Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 December 2022 in EPJ Quantum Technology
Verified
Journal Article
Open access
PDF file
GGGabriel Greene-Diniz
Gabriel Greene-Diniz
DMDavid Zsolt Manrique
David Zsolt Manrique
WSWassil Sennane
Wassil Sennane
YMYann Magnin
Yann Magnin
ESElvira Shishenina
Elvira Shishenina
DRDavid Muñoz Ramo
David Muñoz Ramo
Despite the recent progress in quantum computational algorithms for chemistry, there is a dearth of quantum computational simulations focused on material science applications, especially for the energy sector, where next generation sorbing materials are urgently needed to battle climate change. To drive their development, quantum computing is applied to the problem of CO2 adsorption in Al-fumarate Metal-Organic Frameworks. Fragmentation strategies based on Density Matrix Embedding Theory are applied, using a variational quantum algorithm as a fragment solver, along with active space selection to minimise qubit number. By investigating different fragmentation strategies and solvers, we propose a methodology to apply quantum computing to Al-fumarate interacting with a CO2 molecule, demonstrating the feasibility of treating a complex porous system as a concrete application of quantum computing. We also present emulated hardware calculations and report the impact of device noise on calculations of chemical dissociation, and how the choice of error mitigation scheme can impact this type of calculation in different ways. Our work paves the way for the use of quantum computing techniques in the quest of sorbents optimisation for more efficient carbon capture and conversion applications.

15 February 2023 in Physical Review Research
Verified
Journal Article
Open access
PDF file
MRMarko Rancic
Marko Rancic
Quantum computers are devices, which allow more efficient solutions of problems as compared to their classical counterparts. As the timeline to developing a quantum-error corrected computer is unclear, the quantum computing community has dedicated much attention to developing algorithms for currently available noisy intermediate-scale quantum computers (NISQ). Thus far, within NISQ, optimization problems are one of the most commonly studied and are quite often tackled with the quantum approximate optimization algorithm (QAOA). This algorithm is best known for computing graph partitions with a maximal separation of edges (MaxCut), but can easily calculate other problems related to graphs. Here, I present a novel quantum optimization algorithm, which uses exponentially less qubits as compared to the QAOA while requiring a significantly reduced number of quantum operations to solve the MaxCut problem. Such an improved performance allowed me to partition graphs with 32 nodes on publicly available 5 qubit gate-based quantum computers without any preprocessing such as division of the graph into smaller subgraphs. These results represent a 40% increase in graph size as compared to state-of-art experiments on gate-based quantum computers such as Google Sycamore. The obtained lower bound is 54.9% on the solution for actual hardware benchmarks and 77.6% on ideal simulators of quantum computers. Furthermore, large-scale optimization problems represented by graphs of a 128 nodes are tackled with simulators of quantum computers, again without any predivision into smaller subproblems and a lower solution bound of 67.9% is achieved. The study presented here paves way to using powerful genetic optimizer in synergy with quantum computers.

11 January 2023 in Physical Review A
Verified
Journal Article
Closed access
PDF file
WSWassil Sennane
Wassil Sennane
JPJean-Philip Piquemal
Jean-Philip Piquemal
MRMarko Rancic
Marko Rancic
In this paper we calculate the ground-state energy of benzene under spatial deformations by using the variational quantum eigensolver. The primary goal of the study is to estimate the feasibility of using quantum computing Ansätze on near-term devices to solve problems with a large number of orbitals in regions where classical methods are known to fail. Furthermore, by combining our advanced simulation platform with real quantum computers, we provide an analysis of how the noise, inherent to quantum computers, affects the results. At the center of our study are the hardware efficient and quantum unitary coupled-cluster (QUCC) Ansätze. First, we find that the hardware efficient Ansatz has the potential to outperform mean-field methods for extreme deformations of benzene. However, key problems remain at equilibrium, preventing real chemical application. Moreover, the hardware efficient Ansatz yields results that strongly depend on the initial guess of parameters (in both noisy and noiseless cases) and optimization issues have a higher impact on their convergence than noise. This is confirmed by comparison with real quantum computing demonstrations. On the other hand, the QUCC Ansatz alternative exhibits deeper circuits. Therefore, noise effects increase and are so extreme that the method never outperform mean-field theories. Our dual simulator, (8–16)-qubit QPU computations of QUCC Ansatz appears to be much more sensitive to hardware noise than shot noise, which further indicates where the noise-reduction efforts should be directed. Finally, the study shows that the QUCC method better captures the physics of the system as the QUCC method can be utilized together with the Hückel approximation. We discussed how going beyond this approximation sharply increases the optimization complexity of such a difficult problem.

18 November 2022 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MRMarko Rancic
Marko Rancic
Majorana-zero-modes (MZMs) were predicted to exist as edge states of a physical system called the Kitaev chain. MZMs should host particles that are their own antiparticles and could be used as a basis for a qubit which is robust-to-noise. However, all attempts to prove their existence gave inconclusive results. Here, the Kitaev chain is exactly solved with a quantum computing methodology and properties of MZMs are probed by generating eigenstates of the Kitev Hamiltonian on 3 noisy qubits of a publicly available quantum computer. After an ontological elaboration I show that two eigenstates of the Kitaev Hamiltonian exhibit eight signatures attributed to MZMs. The results presented here are a most comprehensive set of validations of MZMs ever conducted in an actual physical system. Furthermore, the findings of this manuscript are easily reproducible for any user of publicly available quantum computers, solving another important problem of research with MZMs—the result reproducibility crisis.

9 February 2023 in Quantum Science and Technology
Verified
Journal Article
Closed access
PDF file
KSKevin J Sung
Kevin J Sung
MRMarko Rancic
Marko Rancic
OLOlivia T Lanes
Olivia T Lanes
NBNicholas T Bronn
Nicholas T Bronn
The simulation of systems of interacting fermions is one of the most anticipated applications of quantum computers. The most interesting simulations will require a fault-tolerant quantum computer, and building such a device remains a long-term goal. However, the capabilities of existing noisy quantum processors have steadily improved, sparking an interest in running simulations that, while not necessarily classically intractable, may serve as device benchmarks and help elucidate the challenges to achieving practical applications on near-term devices. Systems of non-interacting fermions are ideally suited to serve these purposes. While they display rich physics and generate highly entangled states when simulated on a quantum processor, their classical tractability enables experimental results to be verified even at large system sizes that would typically defy classical simulation. In this work, we use a noisy superconducting quantum processor to prepare Majorana zero modes (MZMs) as eigenstates of the Kitaev chain Hamiltonian, a model of non-interacting fermions. Our work builds on previous experiments with non-interacting fermionic systems. Previous work demonstrated error mitigation techniques applicable to the special case of Slater determinants. Here, we show how to extend these techniques to the case of general fermionic Gaussian states, and demonstrate them by preparing MZMs on systems of up to seven qubits.

1 January 2025 in Quantum Engineering
Verified
Journal Article
Open access
YCYagnik Chatterjee
Yagnik Chatterjee
ZAZaid Allybokus
Zaid Allybokus
MRMarko Rancic
Marko Rancic
EBEric Bourreau
Eric Bourreau
The problem of fleet conversion aims to reduce the carbon emissions and cost of operating a fleet of vehicles for a given set of tours. It can be modeled as a column generation scheme with the maximum weighted independent set (MWIS) problem as the sub‐problem or worker problem. Quantum variational algorithms have gained significant interest in the past several years. Recently, a method to represent quadratic unconstrained binary optimization (QUBO) problems using logarithmically fewer qubits was proposed. Here we use this method to solve the MWIS Workers and demonstrate how quantum and classical solvers can be used together to approach an industrial‐sized use case (up to 64 tours).