Related papers: Efficient Quantum Tensor Product Expanders and k-d…
We propose a formulation of quantum mechanics in an extended Fock space in which a tensor product structure is applied to time. Subspaces of histories consistent with the dynamics of a particular theory are defined by a direct quantum…
We introduce and analyse an efficient decoder for the quantum Tanner codes of that can correct adversarial errors of linear weight. Previous decoders for quantum low-density parity-check codes could only handle adversarial errors of weight…
Quantum walks provide a framework for understanding and designing quantum algorithms that is both intuitive and universal. To leverage the computational power of these walks, it is important to be able to programmably modify the graph a…
An emerging theory of "linear-algebraic pseudorandomness" aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In this work, we study…
Modular tensor categories are generalizations of the representation categories of quantum groups at roots of unity axiomatizing the properties necessary to produce 3-dimensional TQFTs. Although other constructions have since been found,…
Precise nanofabrication represents a critical challenge to developing semiconductor quantum-dot qubits for practical quantum computation. Here, we design and train a convolutional neural network to interpret in-line scanning electron…
This paper introduces the Quantum Covariance Embedding, which embeds Positive Operator-Valued Measures into a tensor product of a Reproducing Kernel Hilbert Space and the quantum state space via a tensorized Bochner integral. This…
We study efficient generations of random diagonal-unitary matrices, an ensemble of unitary matrices diagonal in a given basis with randomly distributed phases for their eigenvalues. Despite the simple algebraic structure, they cannot be…
We extend the preorder on k-tuples of dominant weights of a simple complex Lie algebra g of classical type adding up to a fixed weight $\lambda$ defined by V. Chari, D. Sagaki and the author. We show that the induced extended partial order…
The understanding of complex quantum many-body systems has been vastly boosted by tensor network (TN) methods. Among others, excitation spectrum and long-range interacting systems can be studied using TNs, where one however confronts the…
The representation of numbers by tensor product states of composite quantum systems is examined. Consideration is limited to k-ary representations of length L and arithmetic modulo k^{L}. An abstract representation on an L fold tensor…
A quantum processor (the programmable gate array) is a quantum network with a fixed structure. A space of states is represented as tensor product of data and program registers. Different unitary operations with the data register correspond…
We define quantum expanders in a natural way. We show that under certain conditions classical expander constructions generalize to the quantum setting, and in particular so does the Lubotzky, Philips and Sarnak construction of Ramanujan…
More computational resources (i.e., more physical qubits and qubit connections) on a superconducting quantum processor not only improve the performance but also result in more complex chip architecture with lower yield rate. Optimizing both…
The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and…
We study some counting questions concerning products of positive integers $u_1, \ldots, u_n$ which form a non-zero perfect square, or more generally, a perfect $k$-th power. We obtain an asymptotic formula for the number of such integers of…
We define a time-dependent extension of the quantum geometric tensor to describe the geometry of the time-parameter space for a quantum state, by considering small variations in both time and wave function parameters. Compared to the…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
We study how efficiently a $k$-element set $S\subseteq[n]$ can be learned from a uniform superposition $|S\rangle$ of its elements. One can think of $|S\rangle=\sum_{i\in S}|i\rangle/\sqrt{|S|}$ as the quantum version of a uniformly random…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…