相关论文: A quantum computing scheme for the Hamiltonian pat…

We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…

Given an undirected, unweighted graph with $n$ vertices and $m$ edges, the maximum cut problem is to find a partition of the $n$ vertices into disjoint subsets $V_1$ and $V_2$ such that the number of edges between them is as large as…

Photonic quantum computers are currently one of the primary candidates for fault-tolerant quantum computation. At the heart of the photonic quantum computation lies the strict requirement for suitable quantum sources e.g. high purity, high…

A quantum spline is a smooth curve parameterised by time in the space of unitary transformations, whose associated orbit on the space of pure states traverses a designated set of quantum states at designated times, such that the trace norm…

Quantum computing algorithms using the quantum Fourier transform require repeated use of a phase shift gate. In the case of qubits using optical photons for operation, this gate can be implemented using single-photon beams focused close to…

In this paper we present a novel quantum algorithm, namely the quantum grid search algorithm, to solve a special search problem. Suppose $ k $ non-empty buckets are given, such that each bucket contains some marked and some unmarked items.…

We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…

We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems…

In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is…

In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said…

To obtain estimates of electronic energies, the Variational Quantum Eigensolver (VQE) technique performs separate measurements for multiple parts of the system Hamiltonian. Current quantum hardware is restricted to projective single-qubit…

Xiong and Liu [L. Xiong and Z. Liu, Hamiltonian iterated line graphs, Discrete Math. 256 (2002) 407-422] gave a characterization of the graphs $G$ for which the $n$-th iterated line graph $L^n(G)$ is hamiltonian, for $n\ge2$. In this paper,…

The limited connectivity of current and next-generation quantum annealers motivates the need for efficient graph-minor embedding methods. These methods allow non-native problems to be adapted to the target annealer's architecture. The…

After introducing a bit-plane quantum representation for a multi-image, we present a novel way to encrypt/decrypt multiple images using a quantum computer. Our encryption scheme is based on a two-stage scrambling of the images and of the…

A hamiltonian sequence is a path walk $P$ that can be a hamiltonian path or hamiltonian circuit. Determining whether such hamiltonian sequence exists in a given graph \G is a NP-Complete problem. In this paper, a novel algorithm for…

We consider the problem of tracking one solution path defined by a polynomial homotopy on a parallel shared memory computer. Our robust path tracker applies Newton's method on power series to locate the closest singular parameter value. On…

We study the scattering of photons from periodically modulated quantum-optical systems. For excitation-number conserving quantum optical systems, we connect the analytic structure of the frequency-domain N-photon scattering matrix of the…

Using a quantum processor to embed and process classical data enables the generation of correlations between variables that are inefficient to represent through classical computation. A fundamental question is whether these correlations…

An outstanding problem in the theory of nuclear fission is to understand the Hamiltonian dynamics at the scission point. In this work the fissioning nucleus is modeled in self-consistent mean-field theory as a set of Generator Coordinate…

Quantum algorithms for electronic-structure simulations are actively being developed, yet many hybrid quantum-classical approaches are bottlenecked by the measurement overhead associated with large molecular Hamiltonians. Here we introduce…