Related papers: Comparison of encoding schemes for quantum computi…
In a quantum computer the hardware and software are intrinsically connected because the quantum Hamiltonian (or more precisely its time development) is the code that runs the computer. We demonstrate this subtle and crucial relationship by…
The weighted MAX k-CUT problem involves partitioning a weighted undirected graph into k subsets, or colors, to maximize the sum of the weights of edges between vertices in different subsets. This problem has significant applications across…
This paper reviews quantum spin squeezing, which characterizes the sensitivity of a state with respect to an SU(2) rotation, and is significant for both entanglement detection and high-precision metrology. We first present various…
Quantum secret sharing is a cryptographic scheme that enables a secure storage and reconstruction of quantum information. While the theory of secret sharing is mature in its development, relatively few studies have explored the performance…
Iterative methods that operate with the full Hamiltonian matrix in the untrimmed Hilbert space of a finite system continue to be important tools for the study of one- and two-dimensional quantum spin models, in particular in the presence of…
A quantum computing circuit is presented that approximates a single spin wave quantum on a linear chain of spin 1/2 particles described by a Heisenberg Hamiltonian. The circuit is a product state where each qubit represents a spin. The spin…
Exploiting inherent symmetries is a common and effective approach to speed up the simulation of quantum systems. However, efficiently accounting for non-Abelian symmetries, such as the $SU(2)$ total-spin symmetry, remains a major challenge.…
We set up a real-time path integral to study the evolution of quantum systems driven in real-time completely by the coupling of the system to the environment. For specifically chosen interactions, this can be interpreted as measurements…
Distributing quantum workloads over many Quantum Processing Units (QPUs) is a crucial step in scaling up quantum computers toward practical quantum advantage due to the limitations in size of a single QPU. In the absence of high-fidelity…
The Suzuki-Trotter decomposition, which digitalizes quantum time evolution, provides a promising framework for simulating quantum dynamics on quantum hardware and exploring quantum advantage over classical computation. However, conventional…
A method is presented to transfer a system of two-level atoms from a spin coherent state to a maximally spin squeezed Dicke state, relevant for quantum metrology and quantum information processing. The initial state is the ground state of…
We present efficient methods to reliably characterize and tune gate-defined semiconductor spin qubits. Our methods are designed to target the tuning procedures of semiconductor double quantum dot in GaAs heterostructures, but can easily be…
Digital quantum simulation of electron-phonon systems requires truncating infinite phonon levels into $N$ basis states and then encoding them with qubit computational basis. Unary encoding and the more compact binary/Gray encoding are the…
The utility of solving the Fermi-Hubbard model has been estimated in the billions of dollars. Digital quantum computers can in principle address this task, but have so far been limited to quasi one-dimensional models. This is because of…
Achieving control over the electron spin in quantum dots (artificial atoms) or real atoms promises access to new technologies in conventional and in quantum information processing. Here we review our proposal for quantum computing with…
We present a novel generalization of the chain mapping technique that applies to multi-atom, multimode systems by making use of coupling matrix transformations. This is extremely useful for tensor network simulations of multimode Dicke…
The dynamics and decoherence of an electronic spin-1/2 qubit coupled to a bath of nuclear spins via hyperfine interactions in a quantum dot is studied. We show how exact results from the integrable solution can be used to understand the…
Due to the limitations of present-day quantum hardware, it is especially critical to design algorithms that make the best possible use of available resources. When simulating quantum many-body systems on a quantum computer, straightforward…
We introduce a block encoding method for mapping discrete subgroups to qubits on a quantum computer. This method is applicable to general discrete groups, including crystal-like subgroups such as $\mathbb{BI}$ of $SU(2)$ and $\mathbb{V}$ of…
We review the progress and main challenges in implementing large-scale quantum computing by optical control of electron spins in quantum dots (QDs). Relevant systems include self-assembled QDs of III-V or II-VI compound semiconductors (such…