Related papers: On connectivity-dependent resource requirements fo…
Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It…
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from…
Digital-analog quantum computation aims to reduce the currently infeasible resource requirements needed for near-term quantum information processing by replacing sequences of one- and two-qubit gates with a unitary transformation generated…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
Each year, the gap between theoretical proposals and experimental endeavours to create quantum computers gets smaller, driven by the promise of fundamentally faster algorithms and quantum simulations. This occurs by the combination of…
Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…
In order to achieve speedup over conventional classical computing for finding solution of computationally hard problems, quantum computing was introduced. Quantum algorithms can be simulated in a pseudo quantum environment, but…
As physical implementations of quantum architectures emerge, it is increasingly important to consider the cost of algorithms for practical connectivities between qubits. We show that by using an arrangement of gates that we term the…
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In the era of near-term, noisy, intermediate-scale quantum (NISQ) hardware with…
We show that higher-dimensional versions of qubits, or qudits, can be encoded into spin systems and into harmonic oscillators, yielding important advantages for quantum computation. Whereas qubit-based quantum computation is adequate for…
Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing…
Quantum simulation algorithms often require numerous ancilla qubits and deep circuits, prohibitive for near-term hardware. We introduce a framework for simulating quantum channels using ensembles of low-depth circuits in place of many-qubit…
Experiments in coherent nuclear and electron magnetic resonance,and quantum computing in general correspond to control of quantum mechanical systems, guiding them from initial to final target states by unitary transformations. The control…
Designing efficient quantum processor topologies is pivotal for advancing scalable quantum computing architectures. The communication overhead, a critical factor affecting the execution fidelity of quantum circuits, arises from inevitable…
In this work we investigate methods to improve the efficiency and scalability of quantum algorithms for quantum chemistry applications. We propose a transformation of the electronic structure Hamiltonian in the second quantization framework…
This dissertation explores quantum computation using qudits encoded into large spins, emphasizing the concept of quantum co-design to harness the unique capabilities of physical platforms for enhanced quantum information processing. First,…
This paper investigates the application of quantum computing technology to airline gate-scheduling quadratic assignment problems (QAP). We explore the quantum computing hardware architecture and software environment required for porting…
Quantum simulation is a promising near term application for mesoscale quantum information processors, with the potential to solve computationally intractable problems at the scale of just a few dozen interacting quantum systems. Recent…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…