Related papers: Structure, Optimality, and Symmetry in Shadow Unit…
Reversing an unknown quantum evolution is of central importance to quantum information processing and fundamental physics, yet it remains a formidable challenge as conventional methods necessitate an infinite number of queries to fully…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
Quantum control in large dimensional Hilbert spaces is essential for realizing the power of quantum information processing. For closed quantum systems the relevant input/output maps are unitary transformations, and the fundamental challenge…
Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in…
Quantum optimal control is a technique for controlling the evolution of a quantum system and has been applied to a wide range of problems in quantum physics. We study a binary quantum control optimization problem, where control decisions…
Overcoming the influence of noise and imperfections is a major challenge in quantum computing. Here, we present an approach based on applying a desired unitary computation in superposition between the system of interest and some auxiliary…
Quantum chemistry calculations on a quantum computer frequently suffer from symmetry breaking: the situation when a state of assumed spin and number of electrons is contaminated with contributions of undesired symmetry. The situation may…
We introduce the task of shadow process simulation, where the goal is to simulate the estimation of the expectation values of arbitrary quantum observables at the output of a target physical process. When the sender and receiver share…
The classical shadow estimation protocol is a noise-resilient and sample-efficient quantum algorithm for learning the properties of quantum systems. Its performance depends on the choice of a unitary ensemble, which must be chosen by a user…
We introduce a method that allows one to infer many properties of a quantum state -- including nonlinear functions such as R\'enyi entropies -- using only global control over the constituent degrees of freedom. In this protocol, the state…
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model…
The understanding of symmetry operations has brought enormous advancements in physics, ranging from elementary particle to condensed matter systems. In quantum mechanics, symmetry operations are described by either unitary or antiunitary…
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…
In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…
We generalize the classical shadow tomography scheme to a broad class of finite-depth or finite-time local unitary ensembles, known as locally scrambled quantum dynamics, where the unitary ensemble is invariant under local basis…
Let $\ket{\0}$ and $\ket{\1}$ be two states that are promised to come from known subsets of orthogonal subspaces, but are otherwise unknown. Our paper probes the question of what can be achieved with respect to the basis…
Quantum unitary synthesis addresses the problem of translating abstract quantum algorithms into sequences of hardware-executable quantum gates. Solving this task exactly is infeasible in general due to the exponential growth of the…
Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms with applications in the resolution of partial differential equations, Hamiltonian simulations, the loading of classical data on quantum…
Quantum combs play a vital role in characterizing and transforming quantum processes, with wide-ranging applications in quantum information processing. However, obtaining the explicit quantum circuit for the desired quantum comb remains a…
We describe an efficient quantum algorithm for the quantum Schur transform. The Schur transform is an operation on a quantum computer that maps the standard computational basis to a basis composed of irreducible representations of the…