Related papers: Solovay Kitaev Algorithm and Randomized Compilatio…
We study a simplified version of the Sachdev-Ye-Kitaev (SYK) model with real interactions by exact diagonalization. Instead of satisfying a continuous Gaussian distribution, the interaction strengths are assumed to be chosen from discrete…
Motivated by experimental limitations commonly met in the design of solid state quantum computers, we study the problems of non-local Hamiltonian simulation and non-local gate synthesis when only homogeneous local unitaries are performed in…
We present a polynomial-time quantum algorithm making a single query (in superposition) to a classical oracle, such that for every state $|\psi\rangle$ there exists a choice of oracle that makes the algorithm construct an exponentially…
We present a hybrid quantum-classical framework for simulating generic matrix functions more amenable to early fault-tolerant quantum hardware than standard quantum singular-value transformations. The method is based on randomization over…
Single-qubit operations on singlet-triplet qubits in GaAs double quantum dots have not yet reached the fidelities required for fault-tolerant quantum information processing. Considering experimentally important constraints and using…
Current noisy quantum computers have multiple types of errors, which can occur in the state preparation, measurement/readout, and gate operation, as well as intrinsic decoherence and relaxation. Partly motivated by the booming of…
We study rotating squeezed quantum states created by a parametric resonance in an open harmonic system. As a specific realization of the phenomenon we study a mesoscopic SQUID loop where the state preparation procedure is simple in…
Quantum simulation, fundamental in quantum algorithm design, extends far beyond its foundational roots, powering diverse quantum computing applications. However, optimizing the compilation of quantum Hamiltonian simulation poses significant…
Gate set tomography (GST) provides precise, self-consistent estimates of the noise channels for all of a quantum processor's logic gates. But GST experiments are large, involving many distinct quantum circuits. This has prevented their use…
We propose a quantum protocol that allows preparing a ground state (GS) of the honeycomb Kitaev model. Our approach efficiently uses underlying symmetries and techniques from topological error correction. It is based on the stabilization…
Measurements are a vital part of any quantum computation, whether as a final step to retrieve results, as an intermediate step to inform subsequent operations, or as part of the computation itself (as in measurement-based quantum…
Single qubit rotations and two-qubit CNOT operations are crucial ingredients for universal quantum computing. While high fidelity single qubit operations have been achieved using the electron spin degree of freedom, realizing a robust CNOT…
Accurate and efficient implementation of parallel quantum gates is crucial for scalable quantum information processing. However, the unavoidable crosstalk between qubits in current noisy processors impedes the achievement of high gate…
Quantum state preparation is a crucial process within numerous quantum algorithms, and the need for efficient initialization of quantum registers is ever increasing as demand for useful quantum computing grows. The problem arises as the…
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…
We propose a sampling-based simulation for fault-tolerant quantum error correction under coherent noise. A mixture of incoherent and coherent noise, possibly due to over-rotation, is decomposed into Clifford channels with a quasiprobability…
Most quantum circuits require SWAP gate insertion to run on quantum hardware with limited qubit connectivity. A promising SWAP gate insertion method for blocks of commuting two-qubit gates is a predetermined swap strategy which applies…
Quantum state tomography (QST) is one of the fundamental problems in quantum information. Among various metrics, sample complexity is widely used to evaluate QST algorithms. While multi-copy measurements are known to achieve optimal sample…
The Solovay-Kitaev theorem states that universal quantum gate sets can be exchanged with low overhead. More specifically, any gate on a fixed number of qudits can be simulated with error $\epsilon$ using merely…
The gate fidelity and the coherence time of a qubit are important benchmarks for quantum computation. We construct a qubit using a single electron spin in a Si/SiGe quantum dot and control it electrically via an artificial spin-orbit field…