Related papers: Local complementation rule for continuous-variable…
The connective constant $\mu(G)$ of an infinite transitive graph $G$ is the exponential growth rate of the number of self-avoiding walks from a given origin. In earlier work of Grimmett and Li, a locality theorem was proved for connective…
We establish the emergence of a conformal field theory (CFT) in a (1+1)-dimensional hybrid quantum circuit right at the measurement-driven entanglement transition by revealing space-time conformal covariance of entanglement entropies and…
In this paper we consider connected locally $G$-arc-transitive graphs with vertices of valence 3 and 4, such that the kernel $G_{uv}^{[1]}$ of the action of an edge-stabiliser on the neighourhood $\Gamma(u) \cup \Gamma(v)$ is trivial. We…
The Groverian measures are analytically computed in various types of three-qubit states. The final results are also expressed in terms of local-unitary invariant quantities in each type. This fact reflects the manifest local-unitary…
Every locally normal representation of a local chiral conformal quantum theory is covariant with respect to global conformal transformations, if this theory is diffeomorphism covariant in its vacuum representation. The unitary, strongly…
In this work, we study the complexity of graph-state preparation. We consider general quantum algorithms consisting of Clifford operations acting on at most two qubits for graph-state preparations. We define the CZ-complexity of a graph…
An embedding $i \mapsto p_i\in \mathbb{R}^d$ of the vertices of a graph $G$ is called universally completable if the following holds: For any other embedding $i\mapsto q_i~\in \mathbb{R}^{k}$ satisfying $q_i^T q_j = p_i^T p_j$ for $i = j$…
Compatibility conditions between the (global) spectrum of an $n$-mode Gaussian state and the spectra of the individual modes are presented, making optimal use of beam splitter and (two-mode) squeezing transformations. An unexpected…
The local trajectories method establishes invertibility in algebras $\mathcal{B}= \alg(\mathcal{A}, U_G)$, for a unital $C^*$-algebra $\mathcal{A}$ with a non-trivial center, and a unitary group $U_g$, $g\in G$, with $G$ a discrete group,…
Let $G=(V,E)$ be a finite graph. For $v\in V$ we denote by $G_v$ the subgraph of $G$ that is induced by $v$'s neighbor set. We say that $G$ is $(a,b)$-regular for $a>b>0$ integers, if $G$ is $a$-regular and $G_v$ is $b$-regular for every…
For graphs $G$ and $H$, a homomorphism from $G$ to $H$ is a function $\varphi \colon V(G) \to V(H)$, which maps vertices adjacent in $G$ to adjacent vertices of $H$. A homomorphism is locally injective if no two vertices with a common…
The automorphism invariant theory of Crawford[J. Math. Phys. 35, 2701 (1994)] has show great promise, however its application is limited by the paradigm to the domain of spin space. Our conjecture is that there is a broader principle at…
Gaussian measurements can not be used to witness nonlocality in Gaussian states as well as the network nonlocality in networks of continuous-variable (CV) systems. Thus special non-Gaussian measurements have to be utilized. In the present…
We explore the properties of non-local effective actions which include gravitational couplings. Non-local functions originally defined in flat space can not be easily generalized to curved space. The problem is made worse by the…
Continuous-Variable (CV) devices are a promising platform for demonstrating large-scale quantum information protocols. In this framework, we define a general quantum computational model based on a CV hardware. It consists of vacuum input…
A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…
Local unitary invariants allow one to test whether multipartite states are equivalent up to local basis changes. Equivalently, they specify the geometry of the "orbit space" obtained by factoring out local unitary action from the state…
Graphs are closely related to quantum error-correcting codes: every stabilizer code is locally equivalent to a graph code, and every codeword stabilized code can be described by a graph and a classical code. For the construction of good…
The standard techniques of gauge-fixing, such as covariant gauge fixing, are entirely adequate for the purposes of studies of perturbative QCD. However, they fail in the nonperturbative regime due to the presence of Gribov copies. These…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…