Related papers: Adaptive Quantum Homeopathy
Achieving chemical accuracy with shallow quantum circuits is a significant challenge in quantum computational chemistry, particularly for near-term quantum devices. In this work, we present a Clifford-based Hamiltonian engineering…
We propose and analyze a versatile and efficient multiparameter quantum sensing protocol, which simultaneously estimates many non-commuting and time-dependent signals that are coherently or incoherently coupled to sensing particles. Even in…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits…
Variational quantum algorithms involve training parameterized quantum circuits using a classical co-processor. An important variational algorithm, designed for combinatorial optimization, is the quantum approximate optimization algorithm.…
Unitary $t$-designs are the bread and butter of quantum information theory and beyond. An important issue in practice is that of efficiently constructing good approximations of such unitary $t$-designs. Building on results by Aubrun (Comm.…
Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications…
Unitary $k$-designs are central to quantum information and quantum many-body physics as efficient proxies for Haar-random dynamics. We study how chaotic Hamiltonian evolution can generate unitary $k$-designs. Standard approaches typically…
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations…
The Fermi-Hubbard model, a fundamental framework for studying strongly correlated phenomena could significantly benefit from quantum simulations when exploring non-trivial settings. However, simulating this problem requires twice as many…
Quantum random access memories (QRAMs) are pivotal for data-intensive quantum algorithms, but existing general-purpose and domain-specific architectures are hampered by a critical bottleneck: a heavy reliance on non-Clifford gates (e.g.,…
Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…
Realization of quantum computing requires the development of high-fidelity quantum gates that are resilient to decoherence, control errors, and environmental noise. While non-adiabatic holonomic quantum computation (NHQC) offers a promising…
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. The groups of Pauli and Clifford gates constitute the…
Three-qubit quantum gates are key ingredients for quantum error correction and quantum information processing. We generate quantum-control procedures to design three types of three-qubit gates, namely Toffoli, Controlled-Not-Not and Fredkin…
Simulating the dynamics of electrons and other fermionic particles in quantum chemistry, materials science, and high-energy physics is one of the most promising applications of fault-tolerant quantum computers. However, the overhead in…
The conventional circuit paradigm, utilizing a limited number of gates to construct arbitrary quantum circuits, is hindered by significant noise overhead. For instance, the standard gate paradigm employs two CNOT gates for the partial…
In recent years, the quantum computing community has seen an explosion of novel methods to implement non-trivial quantum computations on near-term hardware. An important direction of research has been to decompose an arbitrary entangled…
We show that single-qudit universality in Clifford-based gate sets follows a trichotomy determined by the prime factorization of the local dimension $d$. For prime $d$, any gate outside the Clifford group is universal. For prime-power…
The creation of composite quantum gates that implement quantum response functions $\hat{U}(\theta)$ dependent on some parameter of interest $\theta$ is often more of an art than a science. Through inspired design, a sequence of $L$…