Related papers: Variational Quantum Eigensolvers in the Era of Dis…
We define some of the programming and system-level challenges facing the application of quantum processing to high-performance computing. Alongside barriers to physical integration, prominent differences in the execution of quantum and…
This work explores the potential of the Variational Quantum Eigensolver in solving Dynamic Portfolio Optimization problems surpassing the 100 qubit utility frontier. We systematically analyze how to scale this strategy in complexity and…
We propose a quantum dot architecture for enabling universal quantum information processing. Quantum registers, consisting of arrays of vertically stacked self-assembled semiconductor quantum dots, are connected by chains of in-plane…
Recently Quantum Computation has generated a lot of interest due to the discovery of a quantum algorithm which can factor large numbers in polynomial time. The usefulness of a quantum com puter is limited by the effect of errors. Simulation…
(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which…
The Quantum Internet, by enabling quantum communications among remote quantum nodes, is a network capable of supporting functionalities with no direct counterpart in the classical world. Indeed, with the network and communications…
The existence of universal quantum computers has been theoretically well established. However, building up a real quantum computer system not only relies on the theory of universality, but also needs methods to satisfy requirements on other…
Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method…
Optimization problems are critical across various domains, yet existing quantum algorithms, despite their great potential, struggle with scalability and accuracy due to excessive reliance on entanglement. To address these limitations, we…
Distributed quantum computing represents at present one of the most promising approaches to scaling quantum processors. Current implementations typically partition circuits into multiple cores, each composed of several qubits, with…
Even a minor boost in solving combinatorial optimization problems can greatly benefit multiple industries. Quantum computers, with their unique information processing capabilities, hold promise for delivering such enhancements. The…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
Quantum annealing processors typically control qubits in unison, attenuating quantum fluctuations uniformly until the applied system Hamiltonian is diagonal in the computational basis. This simplifies control requirements, allowing…
We study coordination under restricted information, where classical local models fail to implement certain correlated distributions because agents cannot condition on past history. We show that quantum systems overcome this limitation even…
A scalable, high-performance quantum processor can be implemented using near-resonant dipole-dipole interacting dopants in a solid state host. In this scheme, the qubits are represented by ground and subradiant states of effective dimers…
Quantum computing as a promising technology can utilize stochastic solutions instead of deterministic approaches for complicated scenarios for which classical computing is inefficient, provided that both the concerns of the error-prone…
Variational quantum algorithms (VQAs) have the potential of utilizing near-term quantum machines to gain certain computational advantages over classical methods. Nevertheless, modern VQAs suffer from cumbersome computational overhead,…
Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. Circuit cutting techniques enable the distribution of quantum computations through classical…
Portfolio construction has been a long-standing topic of research in finance. The computational complexity and the time taken both increase rapidly with the number of investments in the portfolio. It becomes difficult, even impossible for…
In this thesis, I explore whether it is possible to build a unified Quantum Internet architecture that supports different types of quantum repeaters -- especially the two most distinct and seemingly incompatible ones: memory-based quantum…