Related papers: Quantum-inspired permanent identities
Quantum machine learning is often motivated by the idea that quantum systems can expose useful high-dimensional structure that is difficult to access with classical models. We isolate one central component of this claim: the fixed…
A simple probabilistic cellular automaton is shown to be equivalent to a relativistic fermionic quantum field theory with interactions. Occupation numbers for fermions are classical bits or Ising spins. The automaton acts deterministically…
Starting with the zero-square "zeon algebra" the connection with permanents is shown. Permanents of sub-matrices of a linear combination of the identity matrix and all-ones matrix leads to moment polynomials with respect to the exponential…
A natural formulation of the theory of quantum measurements in continuous time is based on quantum stochastic differential equations (Hudson-Parthasarathy equations). However, such a theory was developed only in the case of…
The first quantum technologies to solve computational problems that are beyond the capabilities of classical computers are likely to be devices that exploit characteristics inherent to a particular physical system, to tackle a bespoke…
Boson Sampling is a computational task strongly believed to be hard for classical computers, but efficiently solvable by orchestrated bosonic interference in a specialised quantum computer. Current experimental schemes, however, are still…
Quantum computing has recently been emerging in theoretical chemistry as a realistic avenue meant to offer computational speedup to challenging eigenproblems in the context of strongly-correlated molecular systems or extended materials.…
We examine theoretic architectures and an abstract model for a restricted class of quantum computation, called here instantaneous quantum computation because it allows for essentially no temporal structure within the quantum dynamics. Using…
BosonSampling is a problem where a quantum computer offers a provable speedup over classical computers. Its main feature is that it can be solved with current linear optics technology, without the need for a full quantum computer. In this…
Image-based data is a popular arena for testing quantum machine learning algorithms. A crucial factor in realizing quantum advantage for these applications is the ability to efficiently represent images as quantum states. Here we present a…
This thesis is based upon the work I have done during my PhD candidature at Macquarie University. In this work we develop quantum technologies that are directed towards realising a quantum computer. Specifically, we have made many…
We consider the problem of quantum behavior in the finite background. Introduction of continuum or other infinities into physics leads only to technical complications without any need for them in description of empirical observations. The…
A resolution of the identity due to canonical coherent states is often proven in the weak operator topology. However, such a resolution with an integral symbol is typically supposed to hold in the strong operator topology associated with…
It has been experimentally demonstrated that quantum coherence can persist in macroscopic phenomena [J.R. Friedman et al.,Nature, 406 (2000) 43]. To face the challenge of this new fact, in this article QM in its standard form is assumed to…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…
In this paper we deal with the problem of overcoming the intuitive definition of several color perception attributes by replacing them with novel mathematically rigorous ones. Our framework is a quantum-like color perception theory recently…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
We put forward a possible new interpretation and explanatory framework for quantum theory. The basic hypothesis underlying this new framework is that quantum particles are conceptual entities. More concretely, we propose that quantum…
We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially…
Quantum memory effects are essential in understanding and controlling open quantum systems, yet distinguishing them from classical memory remains challenging. We introduce a convex geometric framework to analyze quantum memory propagating…