Related papers: Tensor Network Assisted Distributed Variational Qu…
Variational quantum algorithms (VQAs) are considered as one of the most promising candidates for achieving quantum advantages on quantum devices in the noisy intermediate-scale quantum (NISQ) era. They have been developed for numerous…
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…
Variational quantum algorithms (VQAs) incorporate hybrid quantum-classical computation aimed at harnessing the power of noisy intermediate-scale quantum (NISQ) computers to solve challenging computational problems. In this thesis, three…
Quantum variational algorithms (QVAs) are increasingly potent tools for simulating quantum many-body systems on noisy intermediate-scale quantum (NISQ) devices. This work examines the application of the Variational Quantum Eigensolver (VQE)…
Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for…
Modern Cloud/Edge architectures need to orchestrate multiple layers of heterogeneous computing nodes, including pervasive sensors/actuators, distributed Edge/Fog nodes, centralized data centers and quantum devices. The optimal assignment…
Variational quantum algorithms (VQAs) have emerged as a promising approach for achieving quantum advantage on current noisy intermediate-scale quantum devices. However, their large-scale applications are significantly hindered by…
Simulations of quantum dynamics are a key application of near term quantum computing, but are hindered by the twin challenges of noise and small device scale, which limit the executable circuit depths and the number of qubits the algorithm…
With rapid advances in quantum hardware, a central question is whether quantum devices with or without full error correction can outperform classical computers on practically relevant problems. Variational Quantum Algorithms (VQAs) have…
While variational quantum algorithms (VQAs) have demonstrated considerable success in unconstrained optimization, their application to constrained combinatorial problems face a trade-off. Penalty-based methods, despite their circuit…
To arrive at some viable product design, product development processes frequently use numerical simulations and mathematical programming techniques. Topology optimization, in particular, is one of the most promising techniques for…
In this work, we present a Gauss-Newton based quantum algorithm (GNQA) for combinatorial optimization problems that, under optimal conditions, rapidly converges towards one of the optimal solutions without being trapped in local minima or…
Combinatorial optimization on near-term quantum devices is a promising path to demonstrating quantum advantage. However, the capabilities of these devices are constrained by high noise or error rates. In this paper, we propose an iterative…
There has been much recent interest in near-term applications of quantum computers, i.e., using quantum circuits that have short decoherence times due to hardware limitations. Variational quantum algorithms (VQA), wherein an optimization…
Quantum processors promise a paradigm shift in high-performance computing which needs to be assessed by accurate benchmarking measures. In this work, we introduce a new benchmark for variational quantum algorithm (VQA), recently proposed as…
The major advances in quantum computing over the last few decades have sparked great interest in applying it to solve the most challenging computational problems in a wide variety of areas. One of the most pronounced domains here are…
Decoded Quantum Interferometry (DQI) is a recently introduced quantum algorithm that reduces discrete optimization to decoding with potential advantages over the best-known polynomial-time classical algorithms for certain Max-LINSAT…
Variational Quantum Algorithms (VQAs) are widely used in the noisy intermediate-scale quantum (NISQ) era, but their trainability and performance depend critically on initialization parameters that shape the optimization landscape. Existing…
Despite the advantage quantum computers are expected to deliver when performing simulations compared to their classical counterparts, the current noisy intermediate-scale quantum (NISQ) devices remain limited in their capabilities. The…
Variational Quantum Algorithms (VQAs) provide a promising framework for tackling complex optimization problems on near-term quantum hardware. Here, we demonstrate that hybrid qubit--qumode quantum devices offer an efficient route to solving…