Related papers: Quantum circuit synthesis for fermionic excitation…
This work proposes a digital quantum simulation protocol for the linear scattering process of bosons, which provides a simple extension to partially distinguishable boson cases. Our protocol is achieved by combining the boson-fermion…
Currently available quantum computing hardware platforms have limited 2-qubit connectivity among their addressable qubits. In order to run a generic quantum algorithm on such a platform, one has to transform the initial logical quantum…
Path sums are a convenient symbolic formalism for quantum operations with applications to the simulation, optimization, and verification of quantum protocols. Unlike quantum circuits, path sums are not limited to unitary operations, but can…
Quantum bits can be isolated to perform useful information-theoretic tasks, even though physical systems are fundamentally described by very high-dimensional operator algebras. This is because qubits can be consistently embedded into…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Immense interest in quantum computing has prompted development of electronic structure methods that are suitable for quantum hardware. However, the slow pace at which quantum hardware progresses, forces researchers to implement their ideas…
In this paper, we develop a Lie group theoretic approach for parametric representation of unitary matrices. This leads to develop a quantum neural network framework for quantum circuit approximation of multi-qubit unitary gates. Layers of…
In this comprehensible article we develop, following Fantoni and Rosati formalism, a hypernetted chain approximation for one dimensional systems of fermions. Our scheme differs from previous treatments in the form that the whole set of…
The development of quantum computing technologies builds on the unique features of quantum physics while borrowing familiar principles from the design of conventional devices. We introduce the fundamental concepts required for designing and…
Dual-unitary circuits are a class of quantum systems for which exact calculations of various quantities are possible, even for circuits that are nonintegrable. The array of known exact results paints a compelling picture of dual-unitary…
A general technique is presented for constructing a quantum theory of a finite number of interacting particles satisfying Poincar\'e invariance, cluster separability, and the spectral condition. Irreducible representations and…
A method for successive synthesis of a Weyl matrix (or Dirichlet-to-Neumann map) of an arbitrary quantum tree is proposed. It allows one, starting from one boundary edge, to compute the Weyl matrix of a whole quantum graph by adding on new…
We develop a unified framework to compute band-geometric quantities in multiband systems whose low-energy Hamiltonians realize arbitrary $SU(2)$ representations. Exploiting the presence of a quantization axis, we use the Wigner--Eckart…
We provide a systematic construction for local quantum circuits hosting free fermions in disguise, both with staircase and brickwork architectures. Similar to the original Hamiltonian model introduced by Fendley, these circuits are defined…
We propose a new architecture for the measurement-based quantum computation model. The new design relies on small composite light-atom primary clusters. These are then assembled into cluster arrays using ancillary light modes and the actual…
We develop fully noncommutative Feynman-Kac formulae by employing quantum stochastic processes. To this end we establish some theory for perturbing quantum stochastic flows on von Neumann algebras by multiplier cocycles. Multiplier cocycles…
We give a new quantum circuit approximation of quantum multiplexors based on the idea of complexity theory oracles. As an added bonus, our multiplexor approximation immediately gives a quantum circuit approximation of diagonal unitary…
Decoupling systems into independently evolving components has a long history of simplifying seemingly complex systems. They enable a better understanding of the underlying dynamics and causal structures while providing more efficient means…
The Gottesman-Knill theorem asserts that quantum circuits composed solely of Clifford gates can be efficiently simulated classically. This theorem hinges on the fact that Clifford gates map Pauli strings to other Pauli strings, thereby…
In this paper, we strengthen the connection between qubit-based quantum circuits and photonic quantum computation. Within the framework of circuit-based quantum computation, the sum-over-paths interpretation of quantum probability…