Related papers: Symmetry Dilemmas in Quantum Computing for Chemist…
We propose a novel symmetrization procedure to beat decoherence for oscillator-assisted quantum gate operations. The enacted symmetry is related to the global geometric features of qubits transformation based on ancillary oscillator modes,…
We study quantum field theories which have quantum groups as global internal symmetries. We show that in such theories operators are generically non-local, and should be thought as living at the ends of topological lines. We describe the…
Quantum computing can enable a variety of breakthroughs in research and industry in the future. Although some quantum algorithms already exist that show a theoretical speedup compared to the best known classical algorithms, the…
A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum…
Measurement-based quantum computation describes a scheme where entanglement of resource states is utilized to simulate arbitrary quantum gates via local measurements. Recent works suggest that symmetry-protected topologically non-trivial,…
The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…
There are strong reasons to believe that global symmetries of quantum theories cannot be exact in the presence of gravity. While this has been argued at the qualitative level, establishing a quantitative statement is more challenging. In…
Recent developments in engineering and algorithms have made real-world applications in quantum computing possible in the near future. Existing quantum programming languages and compilers use a quantum assembly language composed of 1- and…
Fault-tolerant quantum computers which can solve hard problems rely on quantum error correction. One of the most promising error correction codes is the surface code, which requires universal gate fidelities exceeding the error correction…
We investigate how to determine whether the states of a set of quantum systems are identical or not. This paper treats both error-free comparison, and comparison where errors in the result are allowed. Error-free comparison means that we…
We introduce a systematic study of "symmetric quantum circuits", a new restricted model of quantum computation that preserves the symmetries of the problems it solves. This model is well-adapted for studying the role of symmetry in quantum…
As quantum analogs of the classical Kolmogorov-Sinai entropy, quantum dynamical entropies have emerged as important tools to characterize complex quantum dynamics. In particular, Alicki-Fannes-Lindblad (AFL) entropy, which quantifies the…
Operating quantum sensors and quantum computers would make data in the form of quantum states available for purely quantum processing, opening new avenues for studying physical processes and certifying quantum technologies. In this…
Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm…
We propose a technique to design control algorithms for a class of finite dimensional quantum systems so that the control law does not present discontinuities. The class of models considered admits a group of symmetries which allows us to…
Certain quantum gates, such as the controlled-NOT gate, are symmetric in terms of the operation of the control system upon the target system and vice versa. However, no operational criteria yet exist for establishing whether or not a given…
Classical simulation of quantum computers is an irreplaceable step in the design of quantum algorithms. Exponential simulation costs demand the use of high-performance computing techniques, and in particular distribution, whereby the…
Frequently, subroutines in quantum computers have the structure $\mathcal{F}\mathcal{U}\mathcal{F}^{-1}$, where $\mathcal{F}$ is some unitary transform and $\mathcal{U}$ is performing a quantum computation. In this paper we suggest that if,…
Measurement in quantum simulations provides a means for extracting meaningful information from a complex quantum state, and for quantum computing reducing the complexity of measurement will be vital for near-term applications. For most…
The optimal quantum control theory is employed to determine electric pulses capable of producing quantum gates with high fidelity (higher than 0.9997). Particularly, these quantum gates were chosen to perform the permutation algorithm (Z.…