A5044553487- Quantum Computing Algorithms and Architecture
- Quantum many-body systems
- Quantum Information and Cryptography
- Parallel Computing and Optimization Techniques
- Distributed and Parallel Computing Systems
- Computational Physics and Python Applications
- Low-power high-performance VLSI design
- Cloud Computing and Resource Management
- Topic Modeling
- Quantum-Dot Cellular Automata
- Natural Language Processing Techniques
- Mathematics, Computing, and Information Processing
- Gastric Cancer Management and Outcomes
- Colorectal Cancer Treatments and Studies
- Model Reduction and Neural Networks
- Tensor decomposition and applications
- Colorectal Cancer Surgical Treatments
- Cancer Cells and Metastasis
- Viral-associated cancers and disorders
- Digestive system and related health
- Circular RNAs in diseases
- Genetic factors in colorectal cancer
- MicroRNA in disease regulation
- Adenosine and Purinergic Signaling
- Colorectal and Anal Carcinomas
Technical University of Munich
2021-2024
Isotopen Technologien München (Germany)
2024
Guangdong Academy of Medical Sciences
2024
Southern Medical University
2024
Guangdong Provincial People's Hospital
2024
Sun Yat-sen University
2017-2021
Sun Yat-sen University Cancer Center
2020-2021
State Key Laboratory of Oncology in South China
2020-2021
Sixth Affiliated Hospital of Sun Yat-sen University
2017-2018
Highlights•EBVaICC accounted for 6.6% of ICCs and was associated with EBV latency type I infection clonal isolates.•EBVaICChas unique characteristics related to etiology, clinicopathology molecular genetics.•Both PD-1 PD-L1 in tumor-infiltrating lymphocytes tumor cells are overexpressed EBVaICC.•Patients EBVaICC may respond well immune checkpoint inhibitors.•The lymphoepithelioma-like subtype is favorable survival.AbstractBackground & AimsLittle known about Epstein-Barr virus...
Adenocarcinoma of the esophagogastric junction (AEG) is a type tumor that arises at anatomical esophagus and stomach. Although AEG commonly classified as subtype gastric adenocarcinoma (GAC), microenvironment (TME) remains poorly understood. To address this issue, we conducted single-cell RNA sequencing (scRNA-seq) on adjacent normal tissues from four patients performed integrated analysis with publicly available GAC datasets. Our study for first time comprehensively deciphered TME landscape...
MicroRNAs are non-coding RNAs which regulate a variety of cellular functions in the development tumors. Among numerous microRNAs, microRNA-30a (miR-30a) is thought to play an important role processes various human In this study, we aimed explore miR-30a process colorectal cancer (CRC). The quantitative real-time PCR and western blot analysis were used detect expressions CD73 CRC cell lines clinical tissues. luciferase reporter assay was conducted validate association between CD73. CCK-8,...
Metabolism reprogramming is a hallmark of many cancer types. We focused on clear cell renal carcinoma (ccRCC) which characterized by its and glycogen-enriched cytoplasm with unknown reasons. The aim this study was to identify the clinical significance, biological function, molecular regulation glycogen synthase 1 (GYS1) in ccRCC accumulation tumor progression.
We develop and analyze a method for simulating quantum circuits on classical computers by representing states as rooted tree tensor networks. Our algorithm first determines suitable, fixed structure adapted to the expected entanglement generated circuit. The gates are sequentially applied absorbing single-qubit into leaf nodes, splitting two-qubit via singular value decomposition threading resulting virtual bond through tree. theoretically applicability of well its computational cost memory...
Abstract Background and objective Neoadjuvant chemoradiation therapy (NCRT) followed by radical resection has been a common practice for patients with locally advanced rectal cancer. This study aimed to analyse the association of tumor differentiation prognosis in rectal-cancer undergoing NCRT. Methods Patients advanced, non-mucinous cancer who underwent NCRT between 2007 2017 were identified from an electronic health record system at Sixth Affiliated Hospital Sun Yat-sen University...
Abstract Hamiltonian simulation, i.e. simulating the real time evolution of a target quantum system, is natural application computing. Trotter-Suzuki splitting methods can generate corresponding circuits; however, faithful approximation lead to relatively deep circuits. Here we start from insight that for translation invariant systems, gates in such circuit topologies be further optimized on classical computers decrease depth and/or increase accuracy. We employ tensor network techniques and...
This work is concerned with tree tensor network operators (TTNOs) for representing quantum Hamiltonians. We first establish a mathematical framework connecting topologies state diagrams. Based on these, we devise an algorithm constructing TTNO given Hamiltonian. The exploits the product structure of Hamiltonian to add paths diagram, while combining local if possible. test capabilities our random Hamiltonians structure. Additionally, construct explicit TTNOs nearest neighbour interactions...
Computational Fluid Dynamics (CFD) is a major sub-field of engineering. Corresponding flow simulations are typically characterized by heavy computational resource requirements. Often, very fine and complex meshes required to resolve physical effects in an appropriate manner. Since all CFD algorithms scale at least linearly with the size underlying mesh discretization, finding optimal key for efficiency. One methodology used find goal-oriented adaptive refinement. However, this...
Recently, a study from our center indicated that the ratio of preoperative carcinoembryonic antigen (CEA) concentration to maximum tumor diameter (DMAX) may be prognostic marker for patients with rectal cancer. Therefore, aimed evaluate whether this (CEA/DMAX) has value stage II colorectal cancer (CRC).A prospectively maintained database was searched pathologically confirmed CRC who underwent surgery between January 2010 and March 2019. Patients were stratified according mean CEA/DMAX into...
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is natural application computing. Trotter-Suzuki splitting methods can generate corresponding circuits; however, faithful approximation lead to relatively deep circuits. Here we start from insight that for translation invariant systems, gates in such circuit topologies be further optimized on classical computers decrease depth and/or increase accuracy. We employ tensor network techniques and devise...
Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce number of gates executed on specific hardware are required. In this work, we utilize concept synthesis a data structure called Clifford tableaus, focusing applying CNOTs within respective connectivity graph device. We hence contribute field or, more precisely, by reducing synthesized circuit. Upon convergence, our method shows outperform other state-of-the-art techniques, when with respect hardware....
The synthesis of quantum circuits from phase gadgets in the ZX-calculus facilitates circuit optimization. Our work provides an alternative formulation for architecture-aware algorithm PauliOpt [13] by replacing stochastic approach with a heuristic based search and utilizes divide conquer method to synthesize optimized ZX polynomial. We provide comparison our other state-of-the-art optimization libraries. While we note poorer performance highly structured circuits, as QAOA Max-Cut,...
In quantum computing, the efficient optimization of Pauli string decompositions is a crucial aspect for compilation circuits many applications, such as chemistry simulations and machine learning. this paper, we propose novel algorithm synthesis trotterized time-evolution operators that results in with significantly fewer gates than previous solutions. Our procedure takes qubit connectivity target computer into account. As result, generated circuit does not require routing, no additional CNOT...
In recent years, tree tensor network methods have proven capable of simulating quantum many-body and other high-dimensional systems. This work is a user guide to our Python library PyTreeNet. It includes code examples exercises introduce the library's functions familiarise reader with concepts surrounding networks. PyTreeNet implements all tools required implement general methods, such as decompositions arbitrary structures. The main focus on time evolution an introduction states operators...
While colorectal carcinoma is one of the most commonly diagnosed malignancies, its synchronous occurrence with other primary malignancies rare.In this case, we describe diagnosis and surgical intervention a 55-year-old male patient who was found to have colonic adenocarcinoma at hepatic flexure, right renal urothelial carcinoma, malignant mesothelioma.None previous studies reported these three distinct types cancer, even in those patients Lynch Syndrome. To best our knowledge, first report...
Quantum computing's potential as an adjunct to high-performance computing (HPC) infrastructure is clear, but the integration of two (HPCQC) faces numerous challenges. These issues primarily lie in complex needed for integration. Key HPCQC creation a unified hybrid quantum-classical toolchain that reduces latency and supports various quantum technologies. Other obstacles include hardware-related requirements like maintaining uptime networking. This poster focuses on
In the Bloch sphere picture, one finds coefficients for expanding a single-qubit density operator in terms of identity and Pauli matrices. A generalization to $n$ qubits via tensor products represents by real vector length ${4}^{n}$, conceptually similar state vector. Here, we study this approach purpose quantum circuit simulation, including noise processes. The structure leads computationally efficient algorithms applying gates performing few-qubit operations. view variational optimization,...
The synthesis of quantum circuits from phase gadgets in the ZX-calculus facilitates circuit optimization. Our work provides an alternative formulation for architecture-aware algorithm PauliOpt by replacing stochastic approach with a heuristic based search and utilizes divide conquer method to synthesize optimized ZX polynomial. We provide comparison our other state-of-the-art optimization libraries. While we note poorer performance highly structured circuits, as QAOA Max-Cut, demonstrate...
This work is concerned with tree tensor network operators (TTNOs) for representing quantum Hamiltonians. We first establish a mathematical framework connecting topologies state diagrams. Based on these, we devise an algorithm constructing TTNO given Hamiltonian. The exploits the product structure of Hamiltonian to add paths diagram, while combining local if possible. test capabilities our random Hamiltonians structure. Additionally, construct explicit TTNOs nearest neighbour interactions...
We develop and analyze a method for simulating quantum circuits on classical computers by representing states as rooted tree tensor networks. Our algorithm first determines suitable, fixed structure adapted to the expected entanglement generated circuit. The gates are sequentially applied absorbing single-qubit into leaf nodes, splitting two-qubit via singular value decomposition threading resulting virtual bond through tree. theoretically applicability of well its computational cost memory...