Related papers: Quantum Gate Dynamics Beyond the Rotating-Wave App…
Scaling up quantum computing hardware is hindered by the narrow operating margins of current quantum components. Here, we introduce a composite qubit and gate scheme that achieves wide margins by use of transistor-like nonlinearities to…
Building a quantum computer is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations…
In the domain of variational quantum algorithms, quantum Fourier models (QFMs) provide a mathematically well defined structure for quantum machine learning (QML). There has been a substantial amount of work on the scalability and…
Understanding how to tailor quantum dynamics to achieve a desired evolution is a crucial problem in almost all quantum technologies. We present a very general method for designing high-efficiency control sequences that are always fully…
Quantum computation is an attractive front for many problems that are intractable for computers today. One such problem is nonadiabatic quantum molecular dynamics, where quantized internal states coupling to parameterized modes result in a…
This note presents a simple formula for the average fidelity between a unitary quantum gate and a general quantum operation on a qudit, generalizing the formula for qubits found by Bowdrey et al [Phys. Lett. A 294, 258 (2002)]. This formula…
There are important algorithms built upon a mixture of basic techniques described; for example, the Fast Fourier Transform (FFT) employs both Divide-and-Conquer and Transform-and-Conquer techniques. In this article, the evolution of a…
Quantum decision theory (QDT) is a recently developed theory of decision making based on the mathematics of Hilbert spaces, a framework known in physics for its application to quantum mechanics. This framework formalizes the concept of…
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and…
Finite-capacity single-server queues with general service-time distributions form the backbone of numerous real-world systems, yet classical simulation of performance metrics such as blocking probabilities and delay becomes computationally…
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 consider the Rabi Hamiltonian which exhibits a quantum phase transition (QPT) despite consisting only of a single-mode cavity field and a two-level atom. We prove QPT by deriving an exact solution in the limit where the atomic transition…
We develop a Hamiltonian switching ansatz for bipartite control that is inspired by the Quantum Approximate Optimization Algorithm (QAOA), to mitigate environmental noise on qubits. We illustrate the approach with application to the…
Simulating Hamiltonian dynamics is one of the most fundamental and significant tasks for characterising quantum materials. Recently, a series of quantum algorithms employing block-encoding of Hamiltonians have succeeded in providing…
Universal quantum computation requires the implementation of arbitrary control operations on the quantum register. In most cases, this is achieved by external control fields acting selectively on each qubit to drive single-qubit operations.…
Entanglement properties of bipartite unitary operators are studied via their local invariants, namely the entangling power $e_p$ and a complementary quantity, the gate typicality $g_t$. We characterize the boundaries of the set $K_2$…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
Recent advances in quantum technologies have enabled quantum simulation of gauge theories -- some of the most fundamental frameworks of nature -- in regimes far from equilibrium, where classical computation is severely limited. These…