Quantum linear optics without post-selection is not powerful enough to produce any quantum state from a given input state. This limits its utility since some applications require entangled resources that are difficult to prepare. Thus, a deeper understanding of linear optical state preparation is needed. In this work, we give a recipe to derive conserved quantities in the evolution of arbitrary states along any possible passive linear interferometer. One example of such an invariant is the spectrum of a density matrix mapped onto the Lie algebra of passive linear optical Hamiltonians. These invariants give necessary conditions for exact state preparation: if the input and output states have different invariants, it is impossible to design a passive linear interferometer that evolves one into the other. Moreover, we provide a lower bound to the distance between an output and target state based on the distance between their invariants. This gives a necessary condition for approximate or heralded state preparations. Therefore, the invariants allow us to narrow the search when trying to prepare useful entangled states, like NOON states, from easy-to-prepare states, like Fock states. We conclude that future exact and approximate state preparation methods will need to consider the necessary conditions given by our invariants to weed out impossible linear optical evolutions.
A major challenge in photonic quantum technologies is developing strategies to prepare suitable discrete-variable quantum states using simple input states, linear optics, and auxiliary photon measurements to identify successful outcomes. Fundamentally, this challenge arises from the lack of strong non-linearities on the single-photon level, meaning that photonic state preparation based on linear optics cannot benefit from the deterministic gate-based approach available to other physical platforms. Instead, the preparation of quantum states can be probabilistically implemented using single photons, linear-optical networks, and photon detection. However, determining whether an input state can be transformed into a target state using a specific measurement pattern - a problem that can be mapped to deciding the feasibility of a system of polynomial equations - is a complex problem in general. To solve it, we apply the Nullstellensatz Linear Algebra algorithm from algebraic geometry to quantum state generation; this can provide definitive no-go results by proving infeasibility when the state preparation task in question has no solution. We demonstrate this capability to validate and establish lower bounds on the physical resource requirements for the realization of several ubiquitous optical states and gates.
Entanglement is the basic building block of linear optical quantum computation, and as such understanding how to generate it in detail is of great importance for optical architectures. We prove that Bell states cannot be generated using only three photons in the dual-rail encoding, and give strong numerical evidence for the optimality of the existing four photon schemes. In a setup with a single photon in each input mode, we find a fundamental limit on the possible entanglement between a single mode Alice and arbitrary Bob. We investigate and compare other setups aimed at characterizing entanglement in settings more general than dual-rail encoding. The results draw attention to the trade-off between the entanglement a state has and the probability of postselecting that state, which can give surprising constant bounds on entanglement even with increasing numbers of photons.
A linear optics-based scheme to implement various quantum information processing tasks is of paramount importance due to its ease of implementation and low noise. Many information-theoretic tasks depend on the successful discrimination of Bell states. A no-go theorem states that it is not possible to perfectly discriminate among the four Bell states when the measurement apparatus is restricted to linear optical elements. The success probability is only
50%. Using extra resources such as hyperentanglement, ancillary entanglement, and even a minimum amount of non-linearity, complete Bell-state discrimination can be achieved. The success probability for Bell-like state discrimination is only
25%. Bell-like states are non-maximally entangled two-qubit states that resemble Bell states in structure but have unequal Schmidt coefficients. We find that this can be boosted to
50% using hyperentanglement, where extra ancillary degrees of freedom (DOF) of photons, such as polarization, momentum, or OAM, are also entangled along with the system DOF. This contrasts with Bell-state discrimination, where
100% can be achieved. Furthermore, we find that using correlations in the photons' arrival times, all four Bell states can be distinguished with
100% success probability, while for Bell-like state discrimination, it increases only to
37.5% from
25%. We observe a similar contrast when using ancillary entangled photons. While the success probability for discriminating all four Bell states increases as
1−2N1, where
N is the number of ancillary photon pairs, for Bell-like states, it depends on the state parameters and can be less than
25% in some cases. Also, adding further ancillary photons decreases the success probability. We then show that using non-linear gadgets, namely SFG,
100% success probability can be achieved even for Bell-like state discrimination.
Photonic quantum systems are among the most promising architectures for quantum computers. It is well known that for dual-rail photons effective non-linearities and near-deterministic non-trivial two-qubit gates can be achieved via the measurement process and by introducing ancillary photons. While in principle this opens a legitimate path to scalable linear optical quantum computing, the technical requirements are still very challenging and thus other optical encodings are being actively investigated. One of the alternatives is to use single-rail encoded photons, where entangled states can be deterministically generated. Here we prove that even for such systems universal optical quantum computing using only passive optical elements such as beam splitters and phase shifters is not possible. This no-go theorem proves that photon bunching cannot be passively suppressed even when extra ancilla modes and arbitrary number of photons are used. Our result provides useful guidance for the design of optical quantum computers.
Despite well-established no-go theorems on a perfect linear optical Bell state analyzer, we find a numerical trend that appears to approach a near-perfect measurement if we incorporate eight or more un-entangled ancilla photons into our device. Following this trend, we begin a promising inductive approach to building an ideal optical Bell measurement device. In the process, we determine that any Bell state analyzer that (even occasionally) bunches all photons into only two of the output modes cannot perform an ideal measurement and we find a set of conditions on our linear optical circuit that prevent this outcome.