Searcharxiv⌕ Search

arXiv subjects

Marko J. Rančić

Publications and source records attributed to Marko J. Rančić.

At least 19 recordsLinked to original sources

TT-net: Quantum Inspired Tensor Network Denoising in Conditional GANs

Developed as a workhorse for classical simulations of quantum algorithms and quantum many-body systems, Tensor Network methods have entered the scientific mainstream in quantum physics. Among various types of tensor networks, Tensor Trains (commonly know as Matrix Product States in the quantum computing community) have already found applications in machine learning. These methods often rely on a powerful linear algebra tool called the Singular Value Decomposition (SVD). Several conditional GAN architectures for image denoising incorporate SVD as a single-cut decomposition step applied to generator feature maps. In this work we introduce TT-Net, which replaces the per-channel SVD denoising block with a two-cut tensor-train decomposition capable of accessing cross-channel information directly, a capability absent from contemporary alternatives. In a controlled comparison differing only in this decomposition mechanism, TT-Net outperforms SVD-Net on PSNR and SSIM across all three noise types tested (Gaussian, motion blur, and salt-and-pepper), supporting the hypothesis that cross-channel access improves denoising quality. Training-dynamics analysis further shows that TT-Net's adversarial loss term consistently saturates to a stagnant state across all three noise types, more so than SVD-Net's, while reconstruction quality continues to improve regardless, raising an open question about the adversarial component's contribution that this work identifies but does not resolve. Furthermore, for Gaussian noise our method outperforms both the EigenGAN and the state of the art Pix2pix method which does not assume any linear algebra decompositions and does not retain any linear algebra information. Our manuscript shows how quantum inspired tools can be used as practical real world feature filters for deep learning applications.

cs.AI↗

Simulating the Dicke Model on Qubit-Based and hybrid Qubit-Boson-Based Quantum Computers

The Dicke model provides a fundamental description of collective light-matter interactions and has long served as a testbed for exploring a wide range of physical phenomena in quantum optics and condensed matter physics. In this work, we develop a variational framework for investigating the finite-size Dicke model on both fully qubit-based (digital) and hybrid qubit boson based (digital-analogue) quantum computing platforms. We show that the resulting model reproduces the characteristic critical behavior of the Dicke model in the appropriate large-spin limit while remaining suitable for implementation on both classical emulators of quantum computers and actual trapped ion quantum computers, albeit in the case of latter somewhat limited by noise. Finally, we introduce a complementary hybrid qubit-bosonic variational ansatz that directly exploits the bosonic degree of freedom to reduce quantum resources and discuss its potential implementation on hybrid quantum hardware. Our results establish a scalable, symmetry-aware framework for variational quantum simulations of collective light-matter systems and provide a pathway toward efficient simulations of more general spin-boson models on near-term quantum devices.

quant-ph↗

Tensor-network simulation of quantum transport in many-quantum-dot systems

Transport through correlated nanoscale systems underpins the operation of quantum-dot and molecular-scale devices, yet accurate simulations of large open quantum systems remain computationally challenging as system size increases. Tensor-network methods offer a promising route past this scaling barrier by efficiently compressing quantum states. Here we extend a tensor-based solver with a jump-counting estimator that enables direct computation of steady-state electron currents from lead-induced tunneling events. We benchmark the resulting currents against the state-of-the-art master-equation solver QmeQ across a range of lead-dot and inter-dot coupling parameters and find quantitative agreement in the tractable regime. Compared with classical approaches, TJM reduces memory requirements and wall-clock time by orders of magnitude, enabling simulations of interacting quantum-dot arrays far beyond the range accessible to density-matrix-based transport solvers and systematic studies of size-dependent nonequilibrium transport in larger arrays. Our approach allow us to model quantum transport in an array of up to fifty (50) quantum dots.

cond-mat.mes-hall↗

A Hybrid Quantum-assisted Column Generation Algorithm for the Fleet Conversion Problem

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 modelled as a column generation scheme with the Maximum Weighted Independent Set (MWIS) problem as the slave. 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 Slaves and demonstrate how quantum and classical solvers can be used together to approach an industrial-sized use-case (up to 64 tours).

quant-ph↗

Solving various NP-Hard problems using exponentially fewer qubits on a Quantum Computer

NP-hard problems are not believed to be exactly solvable through general polynomial time algorithms. Hybrid quantum-classical algorithms to address such combinatorial problems have been of great interest in the past few years. Such algorithms are heuristic in nature and aim to obtain an approximate solution. Significant improvements in computational time and/or the ability to treat large problems are some of the principal promises of quantum computing in this regard. The hardware, however, is still in its infancy and the current Noisy Intermediate Scale Quantum (NISQ) computers are not able to optimize industrially relevant problems. Moreover, the storage of qubits and introduction of entanglement require extreme physical conditions. An issue with quantum optimization algorithms such as QAOA is that they scale linearly with problem size. In this paper, we build upon a proprietary methodology which scales logarithmically with problem size - opening an avenue for treating optimization problems of unprecedented scale on gate-based quantum computers. In order to test the performance of the algorithm, we first find a way to apply it to a handful of NP-hard problems: Maximum Cut, Minimum Partition, Maximum Clique, Maximum Weighted Independent Set. Subsequently, these algorithms are tested on a quantum simulator with graph sizes of over a hundred nodes and on a real quantum computer up to graph sizes of 256. To our knowledge, these constitute the largest realistic combinatorial optimization problems ever run on a NISQ device, overcoming previous problem sizes by almost tenfold.

quant-ph↗

Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation

Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems but are restricted to moderately entangled states as the number of parameters scales exponentially with the entanglement entropy. While MPS can efficiently find ground states of 1D systems, their capacities are limited when simulating their dynamics, where the entanglement can increase ballistically with time. On the other hand, quantum devices appear as a natural platform to encode and perform the time evolution of correlated many-body states. However, accessing the regime of long-time dynamics is hampered by quantum noise. In this study we use the best of worlds: the short-time dynamics is efficiently performed by MPSs, compiled into short-depth quantum circuits, and is performed further in time on a quantum computer thanks to efficient MPO-optimized quantum circuits. We quantify the capacities of this hybrid classical-quantum scheme in terms of fidelities taking into account a noise model. We show that using classical knowledge in the form of tensor networks provides a way to better use limited quantum resources and lowers drastically the noise requirements to reach a practical quantum advantage. Finally we successfully demonstrate our approach with an experimental realization of the technique. Combined with efficient circuit transpilation we simulate a 10-qubit system on an actual quantum device over a longer time scale than low-bond-dimension MPSs and purely quantum Trotter evolution.

quant-ph↗

Extension of the Trotterized Unitary Coupled Cluster to Triple Excitations

The Trotterized Unitary Coupled Cluster Single and Double (UCCSD) ansatz has recently attracted interest due to its use in Variation Quantum Eigensolver (VQE) molecular simulations on quantum computers. However, when the size of molecules increases, UCCSD becomes less interesting as it cannot achieve sufficient accuracy. Including higher-order excitations is therefore mandatory to recover the UCC's missing correlation effects. In this Letter, we extend the Trotterized UCC approach via the addition of (true) Triple T excitations introducing UCCSDT. We also include both spin and orbital symmetries. Indeed, in practice, these later help to reduce unnecessarily circuit excitations and thus accelerate the optimization process enabling to tackle larger molecules. Our initial numerical tests (12-14 qubits) show that UCCSDT improves the overall accuracy by at least two-orders of magnitudes with respect to standard UCCSD. Overall, the UCCSDT ansatz is shown to reach chemical accuracy and to be competitive with the CCSD(T) gold-standard classical method of quantum chemistry.

physics.chem-ph↗

Noisy intermediate-scale quantum computing algorithm for solving an $n$-vertex MaxCut problem with log($n$) qubits

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

quant-ph↗

Simulating Majorana zero modes on a noisy quantum processor

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 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 Majorana zero modes on systems of up to 7 qubits.

quant-ph↗

Modelling Carbon Capture on Metal-Organic Frameworks with Quantum Computing

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 CO$_2$ 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 CO$_2$ molecule, demonstrating the feasibility of treating a complex porous system as a concrete application of quantum computing. 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.

quant-ph↗

Open Source Variational Quantum Eigensolver Extension of the Quantum Learning Machine (QLM) for Quantum Chemistry

Quantum Chemistry (QC) is one of the most promising applications of Quantum Computing. However, present quantum processing units (QPUs) are still subject to large errors. Therefore, noisy intermediate-scale quantum (NISQ) hardware is limited in terms of qubits counts and circuit depths. Specific algorithms such as Variational Quantum Eigensolvers (VQEs) can potentially overcome such issues. We introduce here a novel open-source QC package, denoted Open-VQE, providing tools for using and developing chemically-inspired adaptive methods derived from Unitary Coupled Cluster (UCC). It facilitates the development and testing of VQE algorithms. It is able to use the Atos Quantum Learning Machine (QLM), a general quantum programming framework enabling to write, optimize and simulate quantum computing programs. Along with Open-VQE, we introduce myQLM-Fermion, a new open-source module (that includes the key QLM ressources that are important for QC developments (fermionic second quantization tools etc...). The Open-VQE package extends therefore QLM to QC providing: (i) the functions to generate the different types of excitations beyond the commonly used UCCSD ans{ä}tz;(ii) a new implementation of the "adaptive derivative assembled pseudo-Trotter method" (ADAPT-VQE), written in simple class structure python codes. Interoperability with other major quantum programming frameworks is ensured thanks to myQLM, which allows users to easily build their own code and execute it on existing QPUs. The combined Open-VQE/myQLM-Fermion quantum simulator facilitates the implementation, tests and developments of variational quantum algorithms towards choosing the best compromise to run QC computations on present quantum computers while offering the possibility to test large molecules. We provide extensive benchmarks for several molecules associated to qubit counts ranging from 4 up to 24.

quant-ph↗

Exactly solving the Kitaev chain and generating Majorana-zero-modes out of noisy qubits

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.

quant-ph↗

Calculating the ground state energy of benzene under spatial deformations with noisy quantum computing

In this manuscript, we calculate the ground state energy of benzene under spatial deformations by using the variational quantum eigensolver (VQE). The primary goal of the study is estimating the feasibility of using quantum computing ansatze on near-term devices for solving problems with 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 provided an analysis of how the noise, inherent to quantum computers, affects the results. The centers of our study are the hardware efficient and quantum unitary coupled cluster ansatze (qUCC). 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 - both in the 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 experiments. 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 qubits QPU computations of qUCC appears to be a lot more sensitive to hardware noise than shot noise, which give further indications about where the noise-reduction efforts should be directed towards. Finally, the study shows that qUCC method better captures the physics of the system as the qUCC method can be utilized together with the Huckel approximation. We discussed how going beyond this approximation sharply increases the optimization complexity of such a difficult problem.

quant-ph↗

A comment on: Universal control of superexchange in linear triple quantum dots with an empty mediator

In a recent preprint arXiv:2203.15521 G. X. Chan, P. Huang, and X. Wang claim that triple-quantum dot superexchange in a (1, 0, 1) charge configuration exhibits a change of sign (going from positive to negative) as a function of middle dot detuning. Furthermore, their claim is that charge sweet-spots exist for specific values of the inter-dot detuning. Their analysis is based on the Hubbard model and something to what they refer to as the full Configuration-Interaction method. All of this findings were already reported by M. J. Rančić and G. Burkard in Ref. Phys. Rev. B 96, 201304(R) (2017) based on the Hubbard model. No reference to this manuscript was made in Ref. arXiv:2203.15521. I have asked the authors to urgently modify the pre-print and position their work with respect to the previously conducted study - which they rejected to do at the current moment, quoting that pp. it is not their style to modify preprints before they were accepted. This alongside with a very similar style of some figures lead me to the conclusion that they are deliberately misleading the scientific community and trying to adopt other peoples work and ideas as their own.

cond-mat.mes-hall↗

Entangling spin and charge degrees of freedom in semiconductor quantum dots

In this theoretical manuscript I propose a scheme for entangling a single electron semiconductor spin qubit with a single electron semiconductor charge qubit in a triangular triple quantum dot configuration. Two out of three quantum dots are used to define a single electron semiconductor charge qubit. Furthermore, the spin qubit is embedded in the Zeeman sub-levels of the third quantum dot. Combining single qubit gates with entangling CNOT gates allows one to construct a SWAP gate, and therefore to use the semiconductor spin qubit as a long-lived memory for the semiconductor charge qubit.

cond-mat.mes-hall↗

Simulating strongly interacting Hubbard chains with the Variational Hamiltonian Ansatz on a quantum computer

Hybrid quantum-classical algorithms have been proposed to circumvent noise limitations in quantum computers. Such algorithms delegate only a calculation of the expectation value to the quantum computer. Among them, the Variational Quantum Eigensolver (VQE) has been implemented to study molecules and condensed matter systems on small size quantum computers. Condensed matter systems described by the Hubbard model exhibit a rich phase diagram alongside exotic states of matter. In this manuscript, we try to answer the question: how much of the underlying physics of a 1D Hubbard chain is described by a problem-inspired Variational Hamiltonian Ansatz (VHA) in a broad range of parameter values ? We start by probing how much does the solution increases fidelity with increasing ansatz complexity. Our findings suggest that even low fidelity solutions capture energy and number of doubly occupied sites well, while spin-spin correlations are not well captured even when the solution is of high fidelity. Our powerful simulation platform allows us to incorporate a realistic noise model and shows a successful implementation of noise-mitigation strategies - post-selection and the Richardson extrapolation. Finally, we compare our results with an experimental realization of the algorithm on IBM Quantum's ibmq_quito device.

cond-mat.str-el↗

Self-controlled growth of highly uniform Ge/Si hut wires for scalable qubit devices

Semiconductor nanowires have been playing a crucial role in the development of nanoscale devices for the realization of spin qubits, Majorana fermions, single photon emitters, nanoprocessors, etc. The monolithic growth of site-controlled nanowires is a prerequisite towards the next generation of devices that will require addressability and scalability. Here, combining top-down nanofabrication and bottom-up self-assembly, we report on the growth of Ge wires on pre-patterned Si (001) substrates with controllable position, distance, length and structure. This is achieved by a novel growth process which uses a SiGe strain-relaxation template and can be generalized to other material combinations. Transport measurements show an electrically tunable spin-orbit coupling, with a spin-orbit length similar to that of III-V materials. Also, capacitive coupling between closely spaced wires is observed, which underlines their potential as a host for implementing two qubit gates. The reported results open a path towards scalable qubit devices with Si compatibility.

cond-mat.mes-hall↗

Entangling Spins in Double Quantum Dots and Majorana Bound States

We study the coupling between a singlet-triplet qubit realized in a double quantum dot to a topological qubit realized by spatially well-separated Majorana bound states. We demonstrate that the singlet-triplet qubit can be leveraged for readout of the topological qubit and for supplementing the gate operations that cannot be performed by braiding of Majorana bound states. Furthermore, we extend our setup to a network of singlet-triplet and topological hybrid qubits that paves the way to scalable fault-tolerant quantum computing.

cond-mat.mes-hall↗