Apers, S, Gawrychowski, P & Lee, T 2022, 'Finding the KT Partition of a Weighted Graph in Near-Linear Time', Leibniz International Proceedings in Informatics, LIPIcs, vol. 245, no. -, pp. 1-14.
View/Download from: Publisher's site
View description>>
In a breakthrough work, Kawarabayashi and Thorup (J. ACM'19) gave a near-linear time deterministic algorithm to compute the weight of a minimum cut in a simple graph G = (V, E). A key component of this algorithm is finding the (1 + ε)-KT partition of G, the coarsest partition {P1, ..., Pk} of V such that for every non-trivial (1 + ε)-near minimum cut with sides {S, S̅} it holds that Pi is contained in either S or S̅, for i = 1, ..., k. In this work we give a near-linear time randomized algorithm to find the (1 + ε)-KT partition of a weighted graph. Our algorithm is quite different from that of Kawarabayashi and Thorup and builds on Karger's framework of tree-respecting cuts (J. ACM'00). We describe a number of applications of the algorithm. (i) The algorithm makes progress towards a more efficient algorithm for constructing the polygon representation of the set of near-minimum cuts in a graph. This is a generalization of the cactus representation, and was initially described by Benczúr (FOCS'95). (ii) We improve the time complexity of a recent quantum algorithm for minimum cut in a simple graph in the adjacency list model from Oe(n3/2) to Oe(√mn), when the graph has n vertices and m edges. (iii) We describe a new type of randomized algorithm for minimum cut in simple graphs with complexity O(m + nlog6 n). For graphs that are not too sparse, this matches the complexity of the current best O(m+nlog2 n) algorithm which uses a different approach based on random contractions. The key technical contribution of our work is the following. Given a weighted graph G with m edges and a spanning tree T of G, consider the graph H whose nodes are the edges of T, and where there is an edge between two nodes of H iff the corresponding 2-respecting cut of T is a non-trivial near-minimum cut of G. We give a O(mlog4 n) time deterministic algorithm to compute a spanning forest of H.
Bagherimehrab, M, Sanders, YR, Berry, DW, Brennen, GK & Sanders, BC 2022, 'Nearly Optimal Quantum Algorithm for Generating the Ground State of a Free Quantum Field Theory', PRX Quantum, vol. 3, no. 2, p. 020364.
View/Download from: Publisher's site
View description>>
We devise a quasilinear quantum algorithm for generating an approximation for the ground state of a quantum field theory (QFT). Our quantum algorithm delivers a superquadratic speedup over the state-of-the-art quantum algorithm for ground-state generation, overcomes the ground-state-generation bottleneck of the prior approach and is optimal up to a polylogarithmic factor. Specifically, we establish two quantum algorithms - Fourier-based and wavelet-based - to generate the ground state of a free massive scalar bosonic QFT with gate complexity quasilinear in the number of discretized QFT modes. The Fourier-based algorithm is limited to translationally invariant QFTs. Numerical simulations show that the wavelet-based algorithm successfully yields the ground state for a QFT with broken translational invariance. Furthermore, the cost of preparing particle excitations in the wavelet approach is independent of the energy scale. Our algorithms require a routine for generating one-dimensional Gaussian (1DG) states. We replace the standard method for 1DG-state generation, which requires the quantum computer to perform lots of costly arithmetic, with a novel method based on inequality testing that significantly reduces the need for arithmetic. Our method for 1DG-state generation is generic and could be extended to preparing states whose amplitudes can be computed on the fly by a quantum computer.
Cheng, H-C, Gao, L & Hsieh, M-H 2022, 'Properties of Noncommutative Rényi and Augustin Information', Communications in Mathematical Physics, vol. 390, no. 2, pp. 501-544.
View/Download from: Publisher's site
View description>>
Rényi and Augustin information are generalizations of mutual information defined via the Rényi divergence, playing a significant role in evaluating the performance of information processing tasks by virtue of its connection to the error exponent analysis. In quantum information theory, there are three generalizations of the classical Rényi divergence—the Petz’s, sandwiched, and log-Euclidean versions, that possess meaningful operational interpretation. However, the associated quantum Rényi and Augustin information are much less explored compared with their classical counterpart, and lacking crucial properties hinders applications of these quantities to error exponent analysis in the quantum regime. The goal of this paper is to analyze fundamental properties of the Rényi and Augustin information from a noncommutative measure-theoretic perspective. Firstly, we prove the uniform equicontinuity for all three quantum versions of Rényi and Augustin information, and it hence yields the joint continuity of these quantities in order and prior input distributions. Secondly, we establish the concavity of the scaled Rényi and Augustin information in the region of s∈ (- 1 , 0) for both Petz’s and the sandwiched versions. This completes the open questions raised by Holevo (IEEE Trans Inf Theory 46(6):2256–2261, 2000), and Mosonyi and Ogawa (Commun Math Phys 355(1):373–426, 2017). For the applications, we show that the strong converse exponent in classical-quantum channel coding satisfies a minimax identity, which means that the strong converse exponent can be attained by the best constant composition code. The established concavity is further employed to prove an entropic duality between classical data compression with quantum side information and classical-quantum channel coding, and a Fenchel duality in joint source-channel coding with quantum side information.
Cheng, H-C, Hanson, EP, Datta, N & Hsieh, M-H 2022, 'Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding', IEEE Transactions on Information Theory, vol. 68, no. 11, pp. 7315-7345.
View/Download from: Publisher's site
View description>>
In this paper, we establish an interesting duality between two different quantum information-processing tasks, namely, classical source coding with quantum side information, and channel coding over classical-quantum channels. The duality relates the optimal error exponents of these two tasks, generalizing the classical results of Ahlswede and Dueck [IEEE Trans. Inf. Theory, 28(3):430-443, 1982]. We establish duality both at the operational level and at the level of the entropic quantities characterizing these exponents. For the latter, the duality is given by an exact relation, whereas for the former, duality manifests itself in the following sense: an optimal coding strategy for one task can be used to construct an optimal coding strategy for the other task. Along the way, we derive a bound on the error exponent for classical-quantum channel coding with constant composition codes which might be of independent interest. Finally, we consider the task of variable-length classical compression with quantum side information, and a duality relation between this task and classical-quantum channel coding can also be established correspondingly. Furthermore, we study the strong converse of this task, and show that the strong converse property does not hold even in the i.i.d. scenario.
Costa, PCS, An, D, Sanders, YR, Su, Y, Babbush, R & Berry, DW 2022, 'Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem', PRX Quantum, vol. 3, no. 4, p. 040303.
View/Download from: Publisher's site
View description>>
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian. Such approaches have enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure. However, the most efficient of those procedures is still asymptotically suboptimal by a factor of log(κ). Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete-time evolutions. In combination with the qubitized quantum walk, our discrete adiabatic theorem gives a speed-up for all adiabatic algorithms. Here, we use this combination to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity. Our O[κlog(1/ µ)] complexity is also optimal in terms of the combined scaling in κ and the precision µ. Compared to existing suboptimal methods, our algorithm is simpler and easier to implement. Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.
Devitt, SJ 2022, 'Blueprinting quantum computing systems', Journal and Proceedings of the Royal Society of New South Wales, vol. 155, no. 1, pp. 5-39.
View description>>
The development of quantum computing systems has been a staple of academic research since the mid-1990s when the first proposal for physical platforms were proposed using Nuclear Magnetic Resonance and Ion-Trap hardware. These first proposals were very basic, essentially consisting of identifying a physical qubit (two-level quantum system) that could be isolated and controlled to achieve universal quantum computation. Over the past thirty years, the nature of quantum architecture design has changed significantly and the scale of investment, groups and companies involved in building quantum computers has increased exponentially. Architectural design for quantum computers examines systems at scale: fully error-corrected machines, potentially consisting of millions if not billions of physical qubits. These designs increasingly act as blueprints for academic groups and companies and are becoming increasingly more detailed, taking into account both the nature and operation of the physical qubits themselves and also peripheral environmental and control infrastructure that is required for each physical system. In this paper, several architectural structures that I have worked on will be reviewed, each of which has been adopted by either a national quantum computing program or a quantum startup. This paper was written in the context of an award with the Royal Society of New South Wales, focused on my personal contributions and impact to quantum computing development, and should be read with that in mind.1
Dietrich, H, Elder, M, Piggott, A, Qiao, Y & Weiß, A 2022, 'The Isomorphism Problem for Plain Groups Is in ΣP3', Leibniz International Proceedings in Informatics, LIPIcs, vol. 219, pp. 26:1-26:14.
View/Download from: Publisher's site
View description>>
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. Sénizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is decidable in PSPACE when the input is given in terms of so-called virtually free presentations. Here we consider the isomorphism problem for the class of plain groups, that is, groups that are isomorphic to a free product of finitely many finite groups and finitely many copies of the infinite cyclic group. Every plain group is naturally and efficiently presented via an inverse-closed finite convergent length-reducing rewriting system. We prove that the isomorphism problem for plain groups given in this form lies in the polynomial time hierarchy, more precisely, in ΣP3. This result is achieved by combining new geometric and algebraic characterisations of groups presented by inverse-closed finite convergent length-reducing rewriting systems developed in recent work of the second and third authors (2021) with classical finite group isomorphism results of Babai and Szemerédi (1984).
Du, Y, Hsieh, M-H, Liu, T, You, S & Tao, D 2022, 'Quantum Differentially Private Sparse Regression Learning', IEEE Transactions on Information Theory, vol. 68, no. 8, pp. 5217-5233.
View/Download from: Publisher's site
Du, Y, Huang, T, You, S, Hsieh, M-H & Tao, D 2022, 'Quantum circuit architecture search for variational quantum algorithms', npj Quantum Information, vol. 8, no. 1.
View/Download from: Publisher's site
View description>>
AbstractVariational quantum algorithms (VQAs) are expected to be a path to quantum advantages on noisy intermediate-scale quantum devices. However, both empirical and theoretical results exhibit that the deployed ansatz heavily affects the performance of VQAs such that an ansatz with a larger number of quantum gates enables a stronger expressivity, while the accumulated noise may render a poor trainability. To maximally improve the robustness and trainability of VQAs, here we devise a resource and runtime efficient scheme termed quantum architecture search (QAS). In particular, given a learning task, QAS automatically seeks a near-optimal ansatz (i.e., circuit architecture) to balance benefits and side-effects brought by adding more noisy quantum gates to achieve a good performance. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks. In the problems studied, numerical and experimental results show that QAS cannot only alleviate the influence of quantum noise and barren plateaus but also outperforms VQAs with pre-selected ansatze.
Faehrmann, PK, Steudtner, M, Kueng, R, Kieferova, M & Eisert, J 2022, 'Randomizing multi-product formulas for Hamiltonian simulation', Quantum, vol. 6, pp. 806-806.
View/Download from: Publisher's site
View description>>
Quantum simulation, the simulation of quantum processes on quantum computers, suggests a path forward for the efficient simulation of problems in condensed-matter physics, quantum chemistry, and materials science. While the majority of quantum simulation algorithms are deterministic, a recent surge of ideas has shown that randomization can greatly benefit algorithmic performance. In this work, we introduce a scheme for quantum simulation that unites the advantages of randomized compiling on the one hand and higher-order multi-product formulas, as they are used for example in linear-combination-of-unitaries (LCU) algorithms or quantum error mitigation, on the other hand. In doing so, we propose a framework of randomized sampling that is expected to be useful for programmable quantum simulators and present two new multi-product formula algorithms tailored to it. Our framework reduces the circuit depth by circumventing the need for oblivious amplitude amplification required by the implementation of multi-product formulas using standard LCU methods, rendering it especially useful for early quantum computers used to estimate the dynamics of quantum systems instead of performing full-fledged quantum phase estimation. Our algorithms achieve a simulation error that shrinks exponentially with the circuit depth. To corroborate their functioning, we prove rigorous performance bounds as well as the concentration of the randomized sampling procedure. We demonstrate the functioning of the approach for several physically meaningful examples of Hamiltonians, including fermionic systems and the Sachdev–Ye–Kitaev model, for which the method provides a favorable scaling in the effort.
Fan, J, Li, J, Zhou, Y, Hsieh, M-H & Poor, HV 2022, 'Entanglement-assisted concatenated quantum codes', Proceedings of the National Academy of Sciences, vol. 119, no. 24.
View/Download from: Publisher's site
View description>>
Entanglement-assisted concatenated quantum codes (EACQCs), constructed by concatenating two quantum codes, are proposed. These EACQCs show significant advantages over standard concatenated quantum codes (CQCs). First, we prove that, unlike standard CQCs, EACQCs can beat the nondegenerate Hamming bound for entanglement-assisted quantum error-correction codes (EAQECCs). Second, we construct families of EACQCs with parameters better than the best-known standard quantum error-correction codes (QECCs) and EAQECCs. Moreover, these EACQCs require very few Einstein–Podolsky–Rosen (EPR) pairs to begin with. Finally, it is shown that EACQCs make entanglement-assisted quantum communication possible, even if the ebits are noisy. Furthermore, EACQCs can outperform CQCs in entanglement fidelity over depolarizing channels if the ebits are less noisy than the qubits. We show that the error-probability threshold of EACQCs is larger than that of CQCs when the error rate of ebits is sufficiently lower than that of qubits. Specifically, we derive a high threshold of 47% when the error probability of the preshared entanglement is 1% to that of qubits.
George, DJ, Sanders, YR, Bagherimehrab, M, Sanders, BC & Brennen, GK 2022, 'Entanglement in quantum field theory via wavelet representations', Physical Review D, vol. 106, no. 3.
View/Download from: Publisher's site
View description>>
Quantum field theory (QFT) describes nature using continuous fields, but physical properties of QFT are usually revealed in terms of measurements of observables at a finite resolution. We describe a multiscale representation of free scalar bosonic and Ising model fermionic QFTs using wavelets. Making use of the orthogonality and self-similarity of the wavelet basis functions, we demonstrate some well-known relations such as scale-dependent subsystem entanglement entropy and renormalization of correlations in the ground state. We also find some new applications of the wavelet transform as a compressed representation of ground states of QFTs which can be used to illustrate quantum phase transitions via fidelity overlap and holographic entanglement of purification.
Ivanyos, G, Mittal, T & Qiao, Y 2022, 'Symbolic Determinant Identity Testing and Non-Commutative Ranks of Matrix Lie Algebras', Leibniz International Proceedings in Informatics, LIPIcs, vol. 215.
View/Download from: Publisher's site
View description>>
One approach to make progress on the symbolic determinant identity testing (SDIT) problem is to study the structure of singular matrix spaces. After settling the non-commutative rank problem (Garg-Gurvits-Oliveira-Wigderson, Found. Comput. Math. 2020; Ivanyos-Qiao-Subrahmanyam, Comput. Complex. 2018), a natural next step is to understand singular matrix spaces whose non-commutative rank is full. At present, examples of such matrix spaces are mostly sporadic, so it is desirable to discover them in a more systematic way. In this paper, we make a step towards this direction, by studying the family of matrix spaces that are closed under the commutator operation, that is, matrix Lie algebras. On the one hand, we demonstrate that matrix Lie algebras over the complex number field give rise to singular matrix spaces with full non-commutative ranks. On the other hand, we show that SDIT of such spaces can be decided in deterministic polynomial time. Moreover, we give a characterization for the matrix Lie algebras to yield a matrix space possessing singularity certificates as studied by Lovász (B. Braz. Math. Soc., 1989) and Raz and Wigderson (Building Bridges II, 2019).
Ji, Z, Natarajan, A, Vidick, T, Wright, J & Yuen, H 2022, 'Quantum Soundness of Testing Tensor Codes', Discrete Analysis, vol. 2022.
View/Download from: Publisher's site
View description>>
A locally testable code is an error-correcting code that admits very efficient probabilistic tests of membership. Tensor codes provide a simple family of combinatorial constructions of locally testable codes that generalize the family of Reed-Muller codes. The natural test for tensor codes, the axis-parallel line vs. point test, plays an essential role in constructions of probabilistically checkable proofs. We analyze the axis-parallel line vs. point test as a two-prover game and show that the test is sound against quantum provers sharing entanglement. Our result implies the quantum-soundness of the low individual degree test, which is an essential component of the MIP = RE theorem. Our proof generalizes to the infinite-dimensional commuting-operator model of quantum provers.
Li, Y, Tan, VYF & Tomamichel, M 2022, 'Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing', Communications in Mathematical Physics, vol. 392, no. 3, pp. 993-1027.
View/Download from: Publisher's site
Mittal, A, Shivakumara, P, Pal, U, Lu, T & Blumenstein, M 2022, 'A new method for detection and prediction of occluded text in natural scene images', Signal Processing: Image Communication, vol. 100, pp. 116512-116512.
View/Download from: Publisher's site
View description>>
Text detection from natural scene images is an active research area for computer vision, signal, and image processing because of several real-time applications such as driving vehicles automatically and tracing person behaviors during sports or marathon events. In these situations, there is a high probability of missing text information due to the occlusion of different objects/persons while capturing images. Unlike most of the existing methods, which focus only on text detection by ignoring the effect of missing texts, this work detects and predicts missing texts so that the performance of the OCR improves. The proposed method exploits the property of DCT for finding significant information in images by selecting multiple channels. For chosen DCT channels, the proposed method studies texture distribution based on statistical measurement to extract features. We propose to adopt Bayesian classifier for categorizing text pixels using extracted features. Then a deep learning model is proposed for eliminating false positives to improve text detection performance. Further, the proposed method employs a Natural Language Processing (NLP) model for predicting missing text information by using detected and recognition texts. Experimental results on our dataset, which contains texts occluded by objects, show that the proposed method is effective in predicting missing text information. To demonstrate the effectiveness and objectiveness of the proposed method, we also tested it on the standard datasets of natural scene images, namely, ICDAR 2017-MLT, Total-Text, and CTW1500.
Morvan, A, Andersen, TI, Mi, X, Neill, C, Petukhov, A, Kechedzhi, K, Abanin, DA, Michailidis, A, Acharya, R, Arute, F, Arya, K, Asfaw, A, Atalaya, J, Bardin, JC, Basso, J, Bengtsson, A, Bortoli, G, Bourassa, A, Bovaird, J, Brill, L, Broughton, M, Buckley, BB, Buell, DA, Burger, T, Burkett, B, Bushnell, N, Chen, Z, Chiaro, B, Collins, R, Conner, P, Courtney, W, Crook, AL, Curtin, B, Debroy, DM, Del Toro Barba, A, Demura, S, Dunsworth, A, Eppens, D, Erickson, C, Faoro, L, Farhi, E, Fatemi, R, Flores Burgos, L, Forati, E, Fowler, AG, Foxen, B, Giang, W, Gidney, C, Gilboa, D, Giustina, M, Grajales Dau, A, Gross, JA, Habegger, S, Hamilton, MC, Harrigan, MP, Harrington, SD, Hoffmann, M, Hong, S, Huang, T, Huff, A, Huggins, WJ, Isakov, SV, Iveland, J, Jeffrey, E, Jiang, Z, Jones, C, Juhas, P, Kafri, D, Khattar, T, Khezri, M, Kieferová, M, Kim, S, Kitaev, AY, Klimov, PV, Klots, AR, Korotkov, AN, Kostritsa, F, Kreikebaum, JM, Landhuis, D, Laptev, P, Lau, K-M, Laws, L, Lee, J, Lee, KW, Lester, BJ, Lill, AT, Liu, W, Locharla, A, Malone, F, Martin, O, McClean, JR, McEwen, M, Meurer Costa, B, Miao, KC, Mohseni, M, Montazeri, S, Mount, E, Mruczkiewicz, W, Naaman, O, Neeley, M, Nersisyan, A, Newman, M, Nguyen, A, Nguyen, M, Niu, MY, O’Brien, TE, Olenewa, R, Opremcak, A, Potter, R, Quintana, C, Rubin, NC, Saei, N, Sank, D, Sankaragomathi, K, Satzinger, KJ, Schurkus, HF, Schuster, C, Shearn, MJ, Shorter, A, Shvarts, V, Skruzny, J, Smith, WC, Strain, D, Sterling, G, Su, Y, Szalay, M, Torres, A, Vidal, G, Villalonga, B, Vollgraff-Heidweiller, C, White, T, Xing, C, Yao, Z, Yeh, P, Yoo, J, Zalcman, A, Zhang, Y, Zhu, N, Neven, H, Bacon, D, Hilton, J, Lucero, E, Babbush, R, Boixo, S, Megrant, A, Kelly, J, Chen, Y, Smelyanskiy, V, Aleiner, I, Ioffe, LB & Roushan, P 2022, 'Formation of robust bound states of interacting microwave photons', Nature, vol. 612, no. 7939, pp. 240-245.
View/Download from: Publisher's site
View description>>
AbstractSystems of correlated particles appear in many fields of modern science and represent some of the most intractable computational problems in nature. The computational challenge in these systems arises when interactions become comparable to other energy scales, which makes the state of each particle depend on all other particles1. The lack of general solutions for the three-body problem and acceptable theory for strongly correlated electrons shows that our understanding of correlated systems fades when the particle number or the interaction strength increases. One of the hallmarks of interacting systems is the formation of multiparticle bound states2–9. Here we develop a high-fidelity parameterizable fSim gate and implement the periodic quantum circuit of the spin-½ XXZ model in a ring of 24 superconducting qubits. We study the propagation of these excitations and observe their bound nature for up to five photons. We devise a phase-sensitive method for constructing the few-body spectrum of the bound states and extract their pseudo-charge by introducing a synthetic flux. By introducing interactions between the ring and additional qubits, we observe an unexpected resilience of the bound states to integrability breaking. This finding goes against the idea that bound states in non-integrable systems are unstable when their energies overlap with the continuum spectrum. Our work provides experimental evidence for bound states of interacting photons and discovers their stability beyond the integrability limit.
Sharma, R, Saqib, M, Lin, CT & Blumenstein, M 2022, 'A Survey on Object Instance Segmentation', SN Computer Science, vol. 3, no. 6, p. 499.
View/Download from: Publisher's site
View description>>
AbstractIn recent years, instance segmentation has become a key research area in computer vision. This technology has been applied in varied applications such as robotics, healthcare and intelligent driving. Instance segmentation technology not only detects the location of the object but also marks edges for each single instance, which can solve both object detection and semantic segmentation concurrently. Our survey will give a detail introduction to the instance segmentation technology based on deep learning, reinforcement learning and transformers. Further, we will discuss about its development in this field along with the most common datasets used. We will also focus on different challenges and future development scope for instance segmentation. This technology will provide a strong reference for future researchers in our survey paper.
Shivakumara, P, Chowdhury, PN, Pal, U, Doermann, D, Ramachandra, R, Lu, T & Blumenstein, M 2022, 'A Knowledge Enforcement Network-Based Approach for Classifying a Photographer’s Images', International Journal of Pattern Recognition and Artificial Intelligence, vol. 36, no. 15, p. 2250046.
View/Download from: Publisher's site
View description>>
Classification of photos captured by different photographers is an important and challenging problem in knowledge-based and image processing. Monitoring and authenticating images uploaded on social media are essential, and verifying the source is one key piece of evidence. We present a novel framework for classifying photos of different photographers based on the combination of local features and deep learning models. The proposed work uses focused and defocused information in the input images to extract contextual information. The model estimates the weighted gradient and calculates entropy to strengthen context features. The focused and defocused information is fused to estimate cross-covariance and define a linear relationship between them. This relationship results in a feature matrix fed to Knowledge Enforcement Network (KEN) for obtaining representative features. Due to the strong discriminative ability of deep learning models, we employ the lightweight and accurate MobileNetV2. The output of KEN and MobileNetV2 is sent to a classifier for photographer classification. Experimental results of the proposed model on our dataset of 46 photographer classes (46234 images) and publicly available datasets of 41 photographer classes (218303 images) show that the method outperforms the existing techniques by 5%–10% on average. The dataset created for the experimental purpose will be made available upon publication.
Shivakumara, P, Das, A, Raghunandan, KS, Pal, U & Blumenstein, M 2022, 'New Deep Spatio-Structural Features of Handwritten Text Lines for Document Age Classification', International Journal of Pattern Recognition and Artificial Intelligence, vol. 36, no. 09.
View/Download from: Publisher's site
View description>>
Document age estimation using handwritten text line images is useful for several pattern recognition and artificial intelligence applications such as forged signature verification, writer identification, gender identification, personality traits identification, and fraudulent document identification. This paper presents a novel method for document age classification at the text line level. For segmenting text lines from handwritten document images, the wavelet decomposition is used in a novel way. We explore multiple levels of wavelet decomposition, which introduce blur as the number of levels increases for detecting word components. The detected components are then used for a direction guided-driven growing approach with linearity, and nonlinearity criteria for segmenting text lines. For classification of text line images of different ages, inspired by the observation that, as the age of a document increases, the quality of its image degrades, the proposed method extracts the structural, contrast, and spatial features to study degradations at different wavelet decomposition levels. The specific advantages of DenseNet, namely, strong feature propagation, mitigation of the vanishing gradient problem, reuse of features, and the reduction of the number of parameters motivated us to use DenseNet121 along with a Multi-layer Perceptron (MLP) for the classification of text lines of different ages by feeding features and the original image as input. To demonstrate the efficacy of the proposed model, experiments were conducted on our own as well as standard datasets for both text line segmentation and document age classification. The results show that the proposed method outperforms the existing methods for text line segmentation in terms of precision, recall, F-measure, and document age classification in terms of average classification rate.
Solntsev, AS, Batalov, SV, Langford, NK & Sukhorukov, AA 2022, 'Complete conversion between one and two photons in nonlinear waveguides: theory of dispersion engineering', New Journal of Physics, vol. 24, no. 6, pp. 065002-065002.
View/Download from: Publisher's site
View description>>
Abstract High-efficiency photon-pair production is a long-sought-after goal for many optical quantum technologies, and coherent photon conversion (CPC) processes are promising candidates for achieving this. We show theoretically how to control coherent conversion between a narrow-band pump photon and broadband photon pairs in nonlinear optical waveguides by tailoring frequency dispersion for broadband quantum frequency mixing. We reveal that complete deterministic conversion as well as pump-photon revival can be achieved at a finite propagation distance. We also find that high conversion efficiencies can be realised robustly over long propagation distances. These results demonstrate that dispersion engineering is a promising way to tune and optimise the CPC process.
Stricker, R, Meth, M, Postler, L, Edmunds, C, Ferrie, C, Blatt, R, Schindler, P, Monz, T, Kueng, R & Ringbauer, M 2022, 'Experimental Single-Setting Quantum State Tomography', PRX Quantum, vol. 3, no. 4, p. 040310.
View/Download from: Publisher's site
View description>>
Quantum computers solve ever more complex tasks using steadily growing system sizes. Characterizing these quantum systems is vital, yet becoming increasingly challenging. The gold-standard method for this task is quantum state tomography (QST), capable of fully reconstructing a quantum state without prior knowledge. The measurement and classical computing costs, however, increase exponentially with the number of constituents (e.g., qubits) - a daunting bottleneck given the scale of existing and near-term quantum devices. Here, we demonstrate a scalable and practical QST approach that only uses a single measurement setting, namely symmetric informationally complete (SIC) positive operator-valued measures (POVMs). We implement these nonorthogonal measurements on an ion trap quantum processor by utilizing additional energy levels within each ion - without requiring ancillary ions to assist in measurements. More precisely, we locally map the SIC POVM to orthogonal states embedded in a higher-dimensional system, which we read out using repeated in-sequence detections, thereby providing full tomographic information in every shot. Combining this SIC tomography with the recently developed randomized measurement toolbox ('classical shadows') proves to be a powerful combination. SIC tomography alleviates the need for choosing measurement settings at random ('derandomization'), while classical shadows enable the estimation of arbitrary polynomial functions of the density matrix orders of magnitudes faster than standard methods. The latter enables in-depth entanglement characterization, which we experimentally showcase on a five-qubit absolutely maximally entangled state. Moreover, the fact that the full tomography information is available in every shot enables online QST in real time (i.e., while the experiment is running). We demonstrate this on an eight-qubit entangled state (which has 28⋅28-1=65535 degrees of freedom), as well as for fast state identification. ...
Wang, Q, Li, R & Ying, M 2022, 'Equivalence Checking of Sequential Quantum Circuits.', IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., vol. 41, no. 9, pp. 3143-3156.
View/Download from: Publisher's site
View description>>
We define a formal framework for equivalence checking of sequential quantum circuits. The model we adopt is a quantum state machine, which is a natural quantum generalisation of Mealy machines. A major difficulty in checking quantum circuits (but not present in checking classical circuits) is that the state spaces of quantum circuits are continuums. This difficulty is resolved by our main theorem showing that equivalence checking of two quantum Mealy machines can be done with input sequences that are taken from some chosen basis (which are finite) and have a length quadratic in the dimensions of the state Hilbert spaces of the machines. Based on this theoretical result, we develop an (and to the best of our knowledge, the first) algorithm for checking equivalence of sequential quantum circuits with running time O(23m+5l(23m+23l)), where m and l denote the numbers of input and internal qubits, respectively. The complexity of our algorithm is comparable with that of the known algorithms for checking classical sequential circuits in the sense that both are exponential in the number of (qu)bits. Several case studies and experiments are presented.
Yan, P & Yu, N 2022, 'The QQUIC Transport Protocol: Quantum-Assisted UDP Internet Connections', Entropy, vol. 24, no. 10, pp. 1488-1488.
View/Download from: Publisher's site
View description>>
Quantum key distribution, initialized in 1984, is a commercialized secure communication method that enables two parties to produce a shared random secret key using quantum mechanics. We propose a QQUIC (Quantum-assisted Quick UDP Internet Connections) transport protocol, which modifies the well-known QUIC transport protocol by employing quantum key distribution instead of the original classical algorithms in the key exchange stage. Due to the provable security of quantum key distribution, the security of the QQUIC key does not depend on computational assumptions. It is possible that, surprisingly, QQUIC can reduce network latency in some circumstances even compared with QUIC. To achieve this, the attached quantum connections are used as the dedicated lines for key generation.
Yan, P, Jiang, H & Yu, N 2022, 'On incorrectness logic for Quantum programs', Proceedings of the ACM on Programming Languages, vol. 6, no. OOPSLA1, pp. 1-28.
View/Download from: Publisher's site
View description>>
Bug-catching is important for developing quantum programs. Motivated by the incorrectness logic for classical programs, we propose an incorrectness logic towards a logical foundation for static bug-catching in quantum programming. The validity of formulas in this logic is dual to that of quantum Hoare logics. We justify the formulation of validity by an intuitive explanation from a reachability point of view and a comparison against several alternative formulations. Compared with existing works focusing on dynamic analysis, our logic provides sound and complete arguments. We further demonstrate the usefulness of the logic by reasoning several examples, including Grover's search, quantum teleportation, and a repeat-until-success program. We also automate the reasoning procedure by a prototyped static analyzer built on top of the logic rules.
Ying, M, Zhou, L, Li, Y & Feng, Y 2022, 'A proof system for disjoint parallel quantum programs.', Theor. Comput. Sci., vol. 897, pp. 164-184.
View/Download from: Publisher's site
View description>>
In this paper, we define the operational and denotational semantics of a special class of parallel quantum programs, namely disjoint parallel quantum programs. Based on them, a proof system for reasoning about disjoint parallel quantum programs is developed, which is (relatively) complete even when entanglement between different processes appears in the preconditions and postconditions.
Yu, N & Zhou, L 2022, 'Comments on and Corrections to “When Is the Chernoff Exponent for Quantum Operations Finite?”', IEEE Transactions on Information Theory, vol. 68, no. 6, pp. 3989-3990.
View/Download from: Publisher's site
Zhao, Y, Chen, J, Zhang, J, Wu, D, Blumenstein, M & Yu, S 2022, 'Detecting and mitigating poisoning attacks in federated learning using generative adversarial networks', Concurrency and Computation: Practice and Experience, vol. 34, no. 7.
View/Download from: Publisher's site
View description>>
SummaryIn the age of the Internet of Things (IoT), large numbers of sensors and edge devices are deployed in various application scenarios; Therefore, collaborative learning is widely used in IoT to implement crowd intelligence by inviting multiple participants to complete a training task. As a collaborative learning framework, federated learning is designed to preserve user data privacy, where participants jointly train a global model without uploading their private training data to a third party server. Nevertheless, federated learning is under the threat of poisoning attacks, where adversaries can upload malicious model updates to contaminate the global model. To detect and mitigate poisoning attacks in federated learning, we propose a poisoning defense mechanism, which uses generative adversarial networks to generate auditing data in the training procedure and removes adversaries by auditing their model accuracy. Experiments conducted on two well‐known datasets, MNIST and Fashion‐MNIST, suggest that federated learning is vulnerable to the poisoning attack, and the proposed defense method can detect and mitigate the poisoning attack.
Zhong, D, Shivakumara, P, Nandanwar, L, Pal, U, Blumenstein, M & Lu, Y 2022, 'Local Resultant Gradient Vector Difference and Inpainting for 3D Text Detection in the Wild', International Journal of Pattern Recognition and Artificial Intelligence, vol. 36, no. 08, p. 2253005.
View/Download from: Publisher's site
View description>>
Three-dimensional (3D) text appearing in natural scene images is common due to 3D cameras and the capture of text from different angles, which presents new problems for text detection. This is because of the presence of depth information, shadows, and decorative characters in the images. In this work, we consider those images where 3D text appears with depth, as well as shadow information for text detection. We propose a novel method based on local resultant gradient vector difference (LRGVD), inpainting and a deep learning model for detecting 3D as well as two-dimensional (2D) texts in natural scene images. The boundary of components that are invariant to the above challenges is detected by exploring LRGVD. The LRGVD uses gradient magnitude and direction in a novel way for detecting the boundary of the components. Further, we propose an inpainting method in a new way for restoring the character background information using boundaries. For a given region and the input image, the inpainting method divides the whole image into planes and then propagates the values in the planes into the missing region based on posterior probabilities and neighboring information. This results in text regions with false positives. Then, the differential binarization network (DB-Net) is proposed for detecting text irrespective of orientation, background, 3D or 2D, etc. Experiments conducted on our 3D text images and standard datasets of natural scene text images, namely ICDAR 2019 MLT, ICDAR 2019 ArT, DAST1500, Total-Text and SCUT-CTW1500, show that the proposed method is effective in detecting 3D and 2D texts in the images.
Zhou, L, Yu, N, Ying, S & Ying, M 2022, 'Quantum earth mover’s distance, a no-go quantum Kantorovich–Rubinstein theorem, and quantum marginal problem', Journal of Mathematical Physics, vol. 63, no. 10, pp. 102201-102201.
View/Download from: Publisher's site
View description>>
The quantum coupling of two given quantum states denotes the set of bipartite states whose marginal states are these given two states. In this paper, we provide tight inequalities to describe the structure of quantum coupling. These inequalities directly imply that the trace distance between two quantum states cannot be determined by the quantum analog of the earth mover’s distance, thus ruling out the equality version of the quantum Kantorovich–Rubinstein theorem for trace distance even in the finite-dimensional case. In addition, we provide an inequality that can be regarded as a quantum generalization of the Kantorovich–Rubinstein theorem. Then, we generalize our inequalities and apply them to the three tripartite quantum marginal problems. Numerical tests with a three-qubit system show that our criteria are much stronger than the known criteria: the strong subadditivity of entropy and the monogamy of entanglement.
Zhou, W-H, Vijayan, MK, Wang, X-W, Lu, Y-H, Gao, J, Jiao, Z-Q, Ren, R-J, Chang, Y-J, Shen, Z-S, Rohde, PP & Jin, X-M 2022, 'Reducing circuit complexity in optical quantum computation using 3D architectures', Optics Express, vol. 30, no. 18, pp. 32887-32887.
View/Download from: Publisher's site
View description>>
Integrated photonic architectures based on optical waveguides are one of the leading candidates for the future realisation of large-scale quantum computation. One of the central challenges in realising this goal is simultaneously minimising loss whilst maximising interferometric visibility within waveguide circuits. One approach is to reduce circuit complexity and depth. A major constraint in most planar waveguide systems is that beamsplitter transformations between distant optical modes require numerous intermediate SWAP operations to couple them into nearest neighbour proximity, each of which introduces loss and scattering. Here, we propose a 3D architecture which can significantly mitigate this problem by geometrically bypassing trivial intermediate operations. We demonstrate the viability of this concept by considering a worst-case 2D scenario, where we interfere the two most distant optical modes in a planar structure. Using femtosecond laser direct-writing technology we experimentally construct a 2D architecture to implement Hong-Ou-Mandel interference between its most distant modes, and a 3D one with corresponding physical dimensions, demonstrating significant improvement in both fidelity and efficiency in the latter case. In addition to improving fidelity and efficiency of individual non-adjacent beamsplitter operations, this approach provides an avenue for reducing the optical depth of circuits comprising complex arrays of beamsplitter operations.
Ahadi, A & Mathieson, L 1970, 'A Bibliometrics Analysis of Australasian Computing Education Conference Proceedings', Proceedings of the 24th Australasian Computing Education Conference, ACE '22: Australasian Computing Education Conference, ACM.
View/Download from: Publisher's site
Apers, S, Efron, Y, Gawrychowski, P, Lee, T, Mukhopadhyay, S & Nanongkai, D 1970, 'Cut Query Algorithms with Star Contraction', 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), IEEE.
View/Download from: Publisher's site
Berta, M & Tomamichel, M 1970, 'Chain rules for quantum channels', 2022 IEEE International Symposium on Information Theory (ISIT), 2022 IEEE International Symposium on Information Theory (ISIT), IEEE.
View/Download from: Publisher's site
Cao, MX, Ramakrishnan, N, Berta, M & Tomamichel, M 1970, 'One-Shot Point-to-Point Channel Simulation', 2022 IEEE International Symposium on Information Theory (ISIT), 2022 IEEE International Symposium on Information Theory (ISIT), IEEE.
View/Download from: Publisher's site
Chen, T-F, Jiang, J-HR & Hsieh, M-H 1970, 'Partial Equivalence Checking of Quantum Circuits', 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), IEEE.
View/Download from: Publisher's site
Guan, J & Yu, N 1970, 'A Probabilistic Logic for Verifying Continuous-time Markov Chains', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer International Publishing, pp. 3-21.
View/Download from: Publisher's site
View description>>
AbstractA continuous-time Markov chain (CTMC) execution is a continuous class of probability distributions over states. This paper proposes a probabilistic linear-time temporal logic, namely continuous-time linear logic (CLL), to reason about the probability distribution execution of CTMCs. We define the syntax of CLL on the space of probability distributions. The syntax of CLL includes multiphase timed until formulas, and the semantics of CLL allows time reset to study relatively temporal properties. We derive a corresponding model-checking algorithm for CLL formulas. The correctness of the model-checking algorithm depends on Schanuel’s conjecture, a central open problem in transcendental number theory. Furthermore, we provide a running example of CTMCs to illustrate our method.
Hong, X, Feng, Y, Li, S & Ying, M 1970, 'Equivalence Checking of Dynamic Quantum Circuits', Proceedings of the 41st IEEE/ACM International Conference on Computer-Aided Design, ICCAD '22: IEEE/ACM International Conference on Computer-Aided Design, ACM, pp. 1-8.
View/Download from: Publisher's site
Ji, Z, Natarajan, A, Vidick, T, Wright, J & Yuen, H 1970, 'Quantum soundness of testing tensor codes', 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), IEEE, pp. 586-597.
View/Download from: Publisher's site
View description>>
A locally testable code is an error-correcting code that admits very efficient probabilistic tests of membership. Tensor codes provide a simple family of combinatorial constructions of locally testable codes that generalize the family of Reed-Muller codes. The natural test for tensor codes, the axis-parallel line vs. point test, plays an essential role in constructions of probabilistically checkable proofs. We analyze the axis-parallel line vs. point test as a two-prover game and show that the test is sound against quantum provers sharing entanglement. Our result implies the quantum-soundness of the low individual degree test, which is an essential component of the MIP∗ = RE theorem. Our proof also generalizes to the infinite-dimensional commuting-operator model of quantum provers.
Li, Y, Bei, X, Qiao, Y, Tao, D & Chen, Z 1970, 'Heterogeneous Multi-commodity Network Flows over Time', Computer Science – Theory and Applications, Springer International Publishing, pp. 238-255.
View/Download from: Publisher's site
View description>>
In the 1950’s, Ford and Fulkerson introduced dynamic flows by incorporating the notion of time into the network flow model (Oper. Res., 1958). In this paper, motivated by real-world applications including route planning and evacuations, we extend the framework of multi-commodity dynamic flows to the heterogeneous commodity setting by allowing different transit times for different commodities along the same edge. We first show how to construct the time-expanded networks, a classical technique in dynamic flows, in the heterogeneous setting. Based on this construction, we give a pseudopolynomial-time algorithm for the quickest flow problem when there are two heterogeneous commodities. We then present a fully polynomial-time approximation scheme when the nodes have storage for any number of heterogeneous commodities. The algorithm is based on the condensed time-expanded network technique introduced by Fleischer and Skutella (SIAM J. Comput., 2007).
Li, Y, Hirche, C & Tomamichel, M 1970, 'Sequential Quantum Channel Discrimination', 2022 IEEE International Symposium on Information Theory (ISIT), 2022 IEEE International Symposium on Information Theory (ISIT), IEEE.
View/Download from: Publisher's site
Lin, T-C & Hsieh, M-H 1970, 'c3-Locally Testable Codes from Lossless Expanders', 2022 IEEE International Symposium on Information Theory (ISIT), 2022 IEEE International Symposium on Information Theory (ISIT), IEEE.
View/Download from: Publisher's site
Nalamati, M, Saqib, M, Sharma, N & Blumenstein, M 1970, 'Exploring Transformers for Intruder Detection in Complex Maritime Environment', Springer International Publishing, pp. 428-439.
View/Download from: Publisher's site
Ouyang, Y & Tomamichel, M 1970, 'Learning quantum graph states with product measurements', 2022 IEEE International Symposium on Information Theory (ISIT), 2022 IEEE International Symposium on Information Theory (ISIT), IEEE.
View/Download from: Publisher's site
Roy, P, Ghosh, S, Bhattacharya, S, Pal, U & Blumenstein, M 1970, 'Scene Aware Person Image Generation through Global Contextual Conditioning', 2022 26th International Conference on Pattern Recognition (ICPR), 2022 26th International Conference on Pattern Recognition (ICPR), IEEE, pp. 2764-2770.
View/Download from: Publisher's site
Roy, P, Ghosh, S, Bhattacharya, S, Pal, U & Blumenstein, M 1970, 'TIPS: Text-Induced Pose Synthesis', Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer Nature Switzerland, pp. 161-178.
View/Download from: Publisher's site
View description>>
In computer vision, human pose synthesis and transfer deal with probabilistic image generation of a person in a previously unseen pose from an already available observation of that person. Though researchers have recently proposed several methods to achieve this task, most of these techniques derive the target pose directly from the desired target image on a specific dataset, making the underlying process challenging to apply in real-world scenarios as the generation of the target image is the actual aim. In this paper, we first present the shortcomings of current pose transfer algorithms and then propose a novel text-based pose transfer technique to address those issues. We divide the problem into three independent stages: (a) text to pose representation, (b) pose refinement, and (c) pose rendering. To the best of our knowledge, this is one of the first attempts to develop a text-based pose transfer framework where we also introduce a new dataset DF-PASS, by adding descriptive pose annotations for the images of the DeepFashion dataset. The proposed method generates promising results with significant qualitative and quantitative scores in our experiments.
Tang, G, Duong, DH, Joux, A, Plantard, T, Qiao, Y & Susilo, W 1970, 'Practical Post-Quantum Signature Schemes from Isomorphism Problems of Trilinear Forms', Advances in Cryptology – EUROCRYPT 2022, Springer International Publishing, pp. 582-612.
View/Download from: Publisher's site
Tang, W, Long, G, Liu, L, Zhou, T, Blumenstein, M & Jiang, J 1970, 'OMNI-SCALE CNNS: A SIMPLE AND EFFECTIVE KERNEL SIZE CONFIGURATION FOR TIME SERIES CLASSIFICATION', ICLR 2022 - 10th International Conference on Learning Representations.
View description>>
The Receptive Field (RF) size has been one of the most important factors for One Dimensional Convolutional Neural Networks (1D-CNNs) on time series classification tasks. Large efforts have been taken to choose the appropriate size because it has a huge influence on the performance and differs significantly for each dataset. In this paper, we propose an Omni-Scale block (OS-block) for 1D-CNNs, where the kernel sizes are decided by a simple and universal rule. Particularly, it is a set of kernel sizes that can efficiently cover the best RF size across different datasets via consisting of multiple prime numbers according to the length of the time series. The experiment result shows that models with the OS-block can achieve a similar performance as models with the searched optimal RF size and due to the strong optimal RF size capture ability, simple 1D-CNN models with OS-block achieves the state-of-the-art performance on four time series benchmarks, including both univariate and multivariate data from multiple domains. Comprehensive analysis and discussions shed light on why the OS-block can capture optimal RF sizes across different datasets. Code available here.
Yu, N 1970, 'Towards Efficient Reasoning of Quantum Programs', Springer Nature Switzerland, pp. 10-15.
View/Download from: Publisher's site
Berta, M, Brandão, FGSL, Gour, G, Lami, L, Plenio, MB, Regula, B & Tomamichel, M 2022, 'On a gap in the proof of the generalised quantum Stein's lemma and its consequences for the reversibility of quantum resources'.
Bremner, MJ, Ji, Z, Li, X, Mathieson, L & Morales, MES 2022, 'Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis'.
Bremner, MJ, Ji, Z, Mann, RL, Mathieson, L, Morales, MES & Shaw, ATE 2022, 'Quantum Parameterized Complexity'.
Cao, MX & Tomamichel, M 2022, 'Comments on 'Channel Coding Rate in the Finite Blocklength Regime': On the Quadratic Decaying Property of the Information Rate Function'.
Cao, MX, Ramakrishnan, N, Berta, M & Tomamichel, M 2022, 'Channel Simulation: Finite Blocklengths and Broadcast Channels'.
Fan, J, Li, J, Zhou, Y, Hsieh, M-H & Poor, HV 2022, 'Entanglement-assisted concatenated quantum codes'.
Gavriel, J, Herr, D, Shaw, A, Bremner, MJ, Paler, A & Devitt, SJ 2022, 'Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes'.
George, DJ, Sanders, YR, Bagherimehrab, M, Sanders, BC & Brennen, GK 2022, 'Entanglement in quantum field theory via wavelet representations'.
Kao, P-Y, Yang, Y-C, Chiang, W-Y, Hsiao, J-Y, Cao, Y, Aliper, A, Ren, F, Aspuru-Guzik, A, Zhavoronkov, A, Hsieh, M-H & Lin, Y-C 2022, 'Exploring the Advantages of Quantum Generative Adversarial Networks in Generative Chemistry'.
Lee, Y-C & Hsieh, M-H 2022, 'On the Capacity of Zero-Drift First Arrival Position Channels in Diffusive Molecular Communication'.
Lee, Y-C, Wu, J-M & Hsieh, M-H 2022, 'A Unified Framework for Calculating First Arrival Position Density in Molecular Communication'.
Lin, T-C, Kim, IH & Hsieh, M-H 2022, 'A new operator extension of strong subadditivity of quantum entropy'.
Liu, C-Y, Wang, H-Y, Liao, P-Y, Lai, C-J & Hsieh, M-H 2022, 'Implementation of Trained Factorization Machine Recommendation System on Quantum Annealer'.
Morales, MES, Costa, PCS, Burgarth, DK, Sanders, YR & Berry, DW 2022, 'Greatly improved higher-order product formulae for quantum simulation'.
Ouyang, Y & Tomamichel, M 2022, 'Learning quantum graph states with product measurements'.
Rambach, M, Youssry, A, Tomamichel, M & Romero, J 2022, 'Efficient Quantum State Tracking in Noisy Environments'.
Roy, P, Ghosh, S, Bhattacharya, S, Pal, U & Blumenstein, M 2022, 'TIPS: Text-Induced Pose Synthesis'.
Shaw, ATE, Bremner, MJ, Paler, A, Herr, D & Devitt, SJ 2022, 'Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array'.
Singal, T, Chiang, C, Hsu, E, Kim, E, Goan, H-S & Hsieh, M-H 2022, 'Counting stabiliser codes for arbitrary dimension'.
Trillo, D, Le, TP & Navascues, M 2022, 'Quantum advantages for transportation tasks: projectiles, rockets and quantum backflow'.
Vijayan, MK, Paler, A, Gavriel, J, Myers, CR, Rohde, PP & Devitt, SJ 2022, 'Compilation of algorithm-specific graph states for quantum circuits'.
Vijayan, MK, Titum, P, Gregory, Q & Ferrie, C 2022, 'Genetic algorithm based filter design for quantum signal detection'.
Yin, X-F, Du, Y, Fei, Y-Y, Zhang, R, Liu, L-Z, Mao, Y, Liu, T, Hsieh, M-H, Li, L, Liu, N-L, Tao, D, Chen, Y-A & Pan, J-W 2022, 'Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver'.
