Related papers: Designs from Local Random Quantum Circuits with SU…
Quantum circuit theory has emerged as an essential tool for the study of the dynamics of superconducting circuits. Recently, the problem of accounting for time-dependent driving via external magnetic fields was addressed by Riwar-DiVincenzo…
QCD justification of SU(m/n) supergroups are shown to provide a basis for the existence of an approximate hadronic supersymmetry. Effective Hamiltonian of the relativistic quark model is derived, leading to hadronic mass formulae in…
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the…
Sample-based quantum diagonalization (SQD) is an algorithm for hybrid quantum-classical molecular simulation that has been of broad interest for application with noisy intermediate scale quantum (NISQ) devices. However, SQD does not always…
We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…
The Local Hamiltonian problem (finding the ground state energy of a quantum system) is known to be QMA-complete. The Local Consistency problem (deciding whether descriptions of small pieces of a quantum system are consistent) is also known…
We introduce a novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits. The method, named "projected - Variational Quantum Dynamics" (p-VQD) realizes an iterative, global projection…
This paper discusses sample allocation problem (SAP) in frequency-domain Compressive Sampling (CS) of time-domain signals. An analysis that is relied on two fundamental CS principles; the Uniform Random Sampling (URS) and the Uncertainty…
This paper narrows the gap between previous literature on quantum linear algebra and practical data analysis on a quantum computer, formalizing quantum procedures that speed-up the solution of eigenproblems for data representations in…
We present a unified framework for quantum sensitivity sampling, extending the advantages of quantum computing to a broad class of classical approximation problems. Our unified framework provides a streamlined approach for constructing…
We investigate dimensional constraints arising from representation theory when abstract graph edges possess internal degrees of freedom but lack geometric properties. We prove that such internal degrees of freedom can only encode…
Circuit cutting enables large quantum circuits to run on small NISQ devices, but it introduces an exponentially high sampling overhead. Here, we present CutVQA, a co-design framework that integrates circuit cutting with quantum architecture…
Quantum-circuit implementations of continuous-time quantum walks (CTQWs) can provide an efficient route to model graph-based algorithms. However, constructing circuits that faithfully reproduce CTQW dynamics across arbitrary graphs remains…
We study analytically as well as numerically the dynamics of a quantum map near a quantum resonance of an order q. The map is embedded into a continuous unitary transformation generated by a time-independent quasi-Hamiltonian. Such a…
Random quantum processes play a central role both in the study of fundamental mixing processes in quantum mechanics related to equilibration, thermalisation and fast scrambling by black holes, as well as in quantum process design and…
Color-ordered amplitudes for the scattering of n particles in the adjoint representation of SU(N) gauge theory satisfy constraints that arise from group theory alone. These constraints break into subsets associated with irreducible…
Quantum Annealing (QA) is a computational framework where a quantum system's continuous evolution is used to find the global minimum of an objective function over an unstructured search space. It can be seen as a general metaheuristic for…
New insight into the correspondence between Quantum Chaos and Random Matrix Theory is gained by developing a semiclassical theory for the autocorrelation function of spectral determinants. We study in particular the unitary operators which…
In conformally invariant quantum field theories one encounters besides the standard DHR superselection theory based on spacelike (Einstein-causal) commutation relations and their Haag duality another timelike (''Huygens'') based…
How much does local and time-periodic dynamics resemble a random unitary? In the present work we address this question by using the Clifford formalism from quantum computation. We analyse a Floquet model with disorder, characterised by a…